20.64/10.25 YES 20.64/10.25 20.64/10.25 Ultimate: Cannot open display: 20.64/10.25 This is Ultimate 0.1.24-8dc7c08-m 20.64/10.25 [2019-03-28 12:43:31,890 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.64/10.25 [2019-03-28 12:43:31,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.64/10.25 [2019-03-28 12:43:31,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.64/10.25 [2019-03-28 12:43:31,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.64/10.25 [2019-03-28 12:43:31,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.64/10.25 [2019-03-28 12:43:31,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.64/10.25 [2019-03-28 12:43:31,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.64/10.25 [2019-03-28 12:43:31,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.64/10.25 [2019-03-28 12:43:31,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.64/10.25 [2019-03-28 12:43:31,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.64/10.25 [2019-03-28 12:43:31,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.64/10.25 [2019-03-28 12:43:31,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.64/10.25 [2019-03-28 12:43:31,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.64/10.25 [2019-03-28 12:43:31,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.64/10.25 [2019-03-28 12:43:31,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.64/10.25 [2019-03-28 12:43:31,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.64/10.25 [2019-03-28 12:43:31,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.64/10.25 [2019-03-28 12:43:31,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.64/10.25 [2019-03-28 12:43:31,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.64/10.25 [2019-03-28 12:43:31,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.64/10.25 [2019-03-28 12:43:31,926 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.64/10.25 [2019-03-28 12:43:31,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.64/10.25 [2019-03-28 12:43:31,927 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.64/10.25 [2019-03-28 12:43:31,928 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.64/10.25 [2019-03-28 12:43:31,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.64/10.25 [2019-03-28 12:43:31,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.64/10.25 [2019-03-28 12:43:31,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.64/10.25 [2019-03-28 12:43:31,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.64/10.25 [2019-03-28 12:43:31,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.64/10.25 [2019-03-28 12:43:31,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.64/10.25 [2019-03-28 12:43:31,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.64/10.25 [2019-03-28 12:43:31,934 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 20.64/10.25 [2019-03-28 12:43:31,948 INFO L110 SettingsManager]: Loading preferences was successful 20.64/10.25 [2019-03-28 12:43:31,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.64/10.25 [2019-03-28 12:43:31,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.64/10.25 [2019-03-28 12:43:31,950 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.64/10.25 [2019-03-28 12:43:31,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.64/10.25 [2019-03-28 12:43:31,950 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.64/10.25 [2019-03-28 12:43:31,950 INFO L133 SettingsManager]: * Use SBE=true 20.64/10.25 [2019-03-28 12:43:31,950 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.64/10.25 [2019-03-28 12:43:31,951 INFO L133 SettingsManager]: * Use old map elimination=false 20.64/10.25 [2019-03-28 12:43:31,951 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.64/10.25 [2019-03-28 12:43:31,951 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.64/10.25 [2019-03-28 12:43:31,951 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.64/10.25 [2019-03-28 12:43:31,951 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.64/10.25 [2019-03-28 12:43:31,951 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.64/10.25 [2019-03-28 12:43:31,952 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.64/10.25 [2019-03-28 12:43:31,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.64/10.25 [2019-03-28 12:43:31,952 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.64/10.25 [2019-03-28 12:43:31,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.64/10.25 [2019-03-28 12:43:31,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.64/10.25 [2019-03-28 12:43:31,952 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.64/10.25 [2019-03-28 12:43:31,953 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.64/10.25 [2019-03-28 12:43:31,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.64/10.25 [2019-03-28 12:43:31,953 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.64/10.25 [2019-03-28 12:43:31,953 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.64/10.25 [2019-03-28 12:43:31,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.64/10.25 [2019-03-28 12:43:31,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.64/10.25 [2019-03-28 12:43:31,954 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.64/10.25 [2019-03-28 12:43:31,954 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.64/10.25 [2019-03-28 12:43:31,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.64/10.25 [2019-03-28 12:43:31,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.64/10.25 [2019-03-28 12:43:31,994 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.64/10.25 [2019-03-28 12:43:31,998 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.64/10.25 [2019-03-28 12:43:31,999 INFO L271 PluginConnector]: Initializing CDTParser... 20.64/10.25 [2019-03-28 12:43:31,999 INFO L276 PluginConnector]: CDTParser initialized 20.64/10.25 [2019-03-28 12:43:32,000 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 20.64/10.25 [2019-03-28 12:43:32,062 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ba11d17434e842fe989e1d6a89e38b88/FLAG7c7699d0a 20.64/10.25 [2019-03-28 12:43:32,405 INFO L307 CDTParser]: Found 1 translation units. 20.64/10.25 [2019-03-28 12:43:32,405 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 20.64/10.25 [2019-03-28 12:43:32,406 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 20.64/10.25 [2019-03-28 12:43:32,412 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ba11d17434e842fe989e1d6a89e38b88/FLAG7c7699d0a 20.64/10.25 [2019-03-28 12:43:33,720 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ba11d17434e842fe989e1d6a89e38b88 20.64/10.25 [2019-03-28 12:43:33,732 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.64/10.25 [2019-03-28 12:43:33,734 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.64/10.25 [2019-03-28 12:43:33,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.64/10.25 [2019-03-28 12:43:33,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.64/10.25 [2019-03-28 12:43:33,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.64/10.25 [2019-03-28 12:43:33,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:33" (1/1) ... 20.64/10.25 [2019-03-28 12:43:33,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653288a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:33, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:33,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:33" (1/1) ... 20.64/10.25 [2019-03-28 12:43:33,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.64/10.25 [2019-03-28 12:43:33,768 INFO L176 MainTranslator]: Built tables and reachable declarations 20.64/10.25 [2019-03-28 12:43:33,940 INFO L206 PostProcessor]: Analyzing one entry point: main 20.64/10.25 [2019-03-28 12:43:33,953 INFO L191 MainTranslator]: Completed pre-run 20.64/10.25 [2019-03-28 12:43:34,030 INFO L206 PostProcessor]: Analyzing one entry point: main 20.64/10.25 [2019-03-28 12:43:34,048 INFO L195 MainTranslator]: Completed translation 20.64/10.25 [2019-03-28 12:43:34,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34 WrapperNode 20.64/10.25 [2019-03-28 12:43:34,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.64/10.25 [2019-03-28 12:43:34,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.64/10.25 [2019-03-28 12:43:34,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.64/10.25 [2019-03-28 12:43:34,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.64/10.25 [2019-03-28 12:43:34,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.64/10.25 [2019-03-28 12:43:34,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.64/10.25 [2019-03-28 12:43:34,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.64/10.25 [2019-03-28 12:43:34,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.64/10.25 [2019-03-28 12:43:34,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.64/10.25 [2019-03-28 12:43:34,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.64/10.25 [2019-03-28 12:43:34,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.64/10.25 [2019-03-28 12:43:34,123 INFO L276 PluginConnector]: RCFGBuilder initialized 20.64/10.25 [2019-03-28 12:43:34,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (1/1) ... 20.64/10.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.64/10.25 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.64/10.25 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.64/10.25 [2019-03-28 12:43:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 20.64/10.25 [2019-03-28 12:43:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.64/10.25 [2019-03-28 12:43:34,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.64/10.25 [2019-03-28 12:43:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 20.64/10.25 [2019-03-28 12:43:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 20.64/10.25 [2019-03-28 12:43:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 20.64/10.25 [2019-03-28 12:43:34,396 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.64/10.25 [2019-03-28 12:43:34,396 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 20.64/10.25 [2019-03-28 12:43:34,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:34 BoogieIcfgContainer 20.64/10.25 [2019-03-28 12:43:34,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.64/10.25 [2019-03-28 12:43:34,399 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.64/10.25 [2019-03-28 12:43:34,399 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.64/10.25 [2019-03-28 12:43:34,402 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.64/10.25 [2019-03-28 12:43:34,403 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:34" (1/1) ... 20.64/10.25 [2019-03-28 12:43:34,418 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 20 edges 20.64/10.25 [2019-03-28 12:43:34,420 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.64/10.25 [2019-03-28 12:43:34,420 INFO L263 BlockEncoder]: Using Maximize final states 20.64/10.25 [2019-03-28 12:43:34,421 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.64/10.25 [2019-03-28 12:43:34,421 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.64/10.25 [2019-03-28 12:43:34,423 INFO L296 BlockEncoder]: Using Remove sink states 20.64/10.25 [2019-03-28 12:43:34,424 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.64/10.25 [2019-03-28 12:43:34,424 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.64/10.25 [2019-03-28 12:43:34,449 INFO L185 BlockEncoder]: Using Use SBE 20.64/10.25 [2019-03-28 12:43:34,483 INFO L200 BlockEncoder]: SBE split 8 edges 20.64/10.25 [2019-03-28 12:43:34,488 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.64/10.25 [2019-03-28 12:43:34,490 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.64/10.25 [2019-03-28 12:43:34,510 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 20.64/10.25 [2019-03-28 12:43:34,513 INFO L70 RemoveSinkStates]: Removed 17 edges and 2 locations by removing sink states 20.64/10.25 [2019-03-28 12:43:34,514 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.64/10.25 [2019-03-28 12:43:34,515 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.64/10.25 [2019-03-28 12:43:34,515 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.64/10.25 [2019-03-28 12:43:34,515 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.64/10.25 [2019-03-28 12:43:34,516 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges 20.64/10.25 [2019-03-28 12:43:34,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:34 BasicIcfg 20.64/10.25 [2019-03-28 12:43:34,516 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.64/10.25 [2019-03-28 12:43:34,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.64/10.25 [2019-03-28 12:43:34,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.64/10.25 [2019-03-28 12:43:34,521 INFO L276 PluginConnector]: TraceAbstraction initialized 20.64/10.25 [2019-03-28 12:43:34,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:43:33" (1/4) ... 20.64/10.25 [2019-03-28 12:43:34,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218b8208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:34, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:34,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (2/4) ... 20.64/10.25 [2019-03-28 12:43:34,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218b8208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:34, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:34,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:34" (3/4) ... 20.64/10.25 [2019-03-28 12:43:34,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218b8208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:34, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:34,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:34" (4/4) ... 20.64/10.25 [2019-03-28 12:43:34,525 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.64/10.25 [2019-03-28 12:43:34,535 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.64/10.25 [2019-03-28 12:43:34,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. 20.64/10.25 [2019-03-28 12:43:34,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. 20.64/10.25 [2019-03-28 12:43:34,593 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.64/10.25 [2019-03-28 12:43:34,594 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.64/10.25 [2019-03-28 12:43:34,594 INFO L383 AbstractCegarLoop]: Hoare is true 20.64/10.25 [2019-03-28 12:43:34,594 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.64/10.25 [2019-03-28 12:43:34,594 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.64/10.25 [2019-03-28 12:43:34,594 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.64/10.25 [2019-03-28 12:43:34,595 INFO L387 AbstractCegarLoop]: Difference is false 20.64/10.25 [2019-03-28 12:43:34,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.64/10.25 [2019-03-28 12:43:34,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.64/10.25 [2019-03-28 12:43:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. 20.64/10.25 [2019-03-28 12:43:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 20.64/10.25 [2019-03-28 12:43:34,615 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:34,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:34,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:34,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash 3794188, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:34,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:34,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:34,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:34,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:34,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:34,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:34,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.64/10.25 [2019-03-28 12:43:34,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.64/10.25 [2019-03-28 12:43:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.64/10.25 [2019-03-28 12:43:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:34,806 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. 20.64/10.25 [2019-03-28 12:43:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:34,880 INFO L93 Difference]: Finished difference Result 12 states and 20 transitions. 20.64/10.25 [2019-03-28 12:43:34,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:34,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 20.64/10.25 [2019-03-28 12:43:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:34,894 INFO L225 Difference]: With dead ends: 12 20.64/10.25 [2019-03-28 12:43:34,894 INFO L226 Difference]: Without dead ends: 11 20.64/10.25 [2019-03-28 12:43:34,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 20.64/10.25 [2019-03-28 12:43:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 20.64/10.25 [2019-03-28 12:43:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.64/10.25 [2019-03-28 12:43:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. 20.64/10.25 [2019-03-28 12:43:34,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 4 20.64/10.25 [2019-03-28 12:43:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:34,934 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. 20.64/10.25 [2019-03-28 12:43:34,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. 20.64/10.25 [2019-03-28 12:43:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 20.64/10.25 [2019-03-28 12:43:34,935 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:34,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:34,935 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 3794190, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:34,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:34,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:34,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:34,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:34,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:34,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:34,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.64/10.25 [2019-03-28 12:43:34,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.64/10.25 [2019-03-28 12:43:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.64/10.25 [2019-03-28 12:43:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 20.64/10.25 [2019-03-28 12:43:34,970 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. 20.64/10.25 [2019-03-28 12:43:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,020 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. 20.64/10.25 [2019-03-28 12:43:35,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.64/10.25 [2019-03-28 12:43:35,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 20.64/10.25 [2019-03-28 12:43:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,021 INFO L225 Difference]: With dead ends: 12 20.64/10.25 [2019-03-28 12:43:35,022 INFO L226 Difference]: Without dead ends: 11 20.64/10.25 [2019-03-28 12:43:35,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 20.64/10.25 [2019-03-28 12:43:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 20.64/10.25 [2019-03-28 12:43:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 20.64/10.25 [2019-03-28 12:43:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.64/10.25 [2019-03-28 12:43:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 20.64/10.25 [2019-03-28 12:43:35,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 20.64/10.25 [2019-03-28 12:43:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,026 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. 20.64/10.25 [2019-03-28 12:43:35,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.64/10.25 [2019-03-28 12:43:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. 20.64/10.25 [2019-03-28 12:43:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 20.64/10.25 [2019-03-28 12:43:35,027 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash 3794191, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.64/10.25 [2019-03-28 12:43:35,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.64/10.25 [2019-03-28 12:43:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.64/10.25 [2019-03-28 12:43:35,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:35,056 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. 20.64/10.25 [2019-03-28 12:43:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,100 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. 20.64/10.25 [2019-03-28 12:43:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:35,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 20.64/10.25 [2019-03-28 12:43:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,101 INFO L225 Difference]: With dead ends: 11 20.64/10.25 [2019-03-28 12:43:35,101 INFO L226 Difference]: Without dead ends: 10 20.64/10.25 [2019-03-28 12:43:35,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. 20.64/10.25 [2019-03-28 12:43:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 20.64/10.25 [2019-03-28 12:43:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.64/10.25 [2019-03-28 12:43:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 4 20.64/10.25 [2019-03-28 12:43:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,105 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 20.64/10.25 [2019-03-28 12:43:35,106 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,106 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash 117620798, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.64/10.25 [2019-03-28 12:43:35,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.64/10.25 [2019-03-28 12:43:35,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.64/10.25 [2019-03-28 12:43:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:35,138 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. 20.64/10.25 [2019-03-28 12:43:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,181 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:35,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 20.64/10.25 [2019-03-28 12:43:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,182 INFO L225 Difference]: With dead ends: 10 20.64/10.25 [2019-03-28 12:43:35,182 INFO L226 Difference]: Without dead ends: 9 20.64/10.25 [2019-03-28 12:43:35,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. 20.64/10.25 [2019-03-28 12:43:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 20.64/10.25 [2019-03-28 12:43:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 20.64/10.25 [2019-03-28 12:43:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 20.64/10.25 [2019-03-28 12:43:35,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 5 20.64/10.25 [2019-03-28 12:43:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,185 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. 20.64/10.25 [2019-03-28 12:43:35,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. 20.64/10.25 [2019-03-28 12:43:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 20.64/10.25 [2019-03-28 12:43:35,186 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,187 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash 117620800, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.64/10.25 [2019-03-28 12:43:35,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.64/10.25 [2019-03-28 12:43:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.64/10.25 [2019-03-28 12:43:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.64/10.25 [2019-03-28 12:43:35,226 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. 20.64/10.25 [2019-03-28 12:43:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,268 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. 20.64/10.25 [2019-03-28 12:43:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.64/10.25 [2019-03-28 12:43:35,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 20.64/10.25 [2019-03-28 12:43:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,271 INFO L225 Difference]: With dead ends: 15 20.64/10.25 [2019-03-28 12:43:35,271 INFO L226 Difference]: Without dead ends: 14 20.64/10.25 [2019-03-28 12:43:35,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 20.64/10.25 [2019-03-28 12:43:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 20.64/10.25 [2019-03-28 12:43:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. 20.64/10.25 [2019-03-28 12:43:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.64/10.25 [2019-03-28 12:43:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 5 20.64/10.25 [2019-03-28 12:43:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,277 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.64/10.25 [2019-03-28 12:43:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 20.64/10.25 [2019-03-28 12:43:35,277 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,278 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash 117620801, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 20.64/10.25 [2019-03-28 12:43:35,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 20.64/10.25 [2019-03-28 12:43:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 20.64/10.25 [2019-03-28 12:43:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 20.64/10.25 [2019-03-28 12:43:35,327 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. 20.64/10.25 [2019-03-28 12:43:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,383 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. 20.64/10.25 [2019-03-28 12:43:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 20.64/10.25 [2019-03-28 12:43:35,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 20.64/10.25 [2019-03-28 12:43:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,385 INFO L225 Difference]: With dead ends: 14 20.64/10.25 [2019-03-28 12:43:35,385 INFO L226 Difference]: Without dead ends: 13 20.64/10.25 [2019-03-28 12:43:35,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 20.64/10.25 [2019-03-28 12:43:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 20.64/10.25 [2019-03-28 12:43:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. 20.64/10.25 [2019-03-28 12:43:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.64/10.25 [2019-03-28 12:43:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. 20.64/10.25 [2019-03-28 12:43:35,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 20.64/10.25 [2019-03-28 12:43:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,389 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. 20.64/10.25 [2019-03-28 12:43:35,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 20.64/10.25 [2019-03-28 12:43:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. 20.64/10.25 [2019-03-28 12:43:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 20.64/10.25 [2019-03-28 12:43:35,389 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1364412798, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.64/10.25 [2019-03-28 12:43:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.64/10.25 [2019-03-28 12:43:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.64/10.25 [2019-03-28 12:43:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:35,424 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 3 states. 20.64/10.25 [2019-03-28 12:43:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,448 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. 20.64/10.25 [2019-03-28 12:43:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:35,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 20.64/10.25 [2019-03-28 12:43:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,449 INFO L225 Difference]: With dead ends: 10 20.64/10.25 [2019-03-28 12:43:35,449 INFO L226 Difference]: Without dead ends: 8 20.64/10.25 [2019-03-28 12:43:35,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.64/10.25 [2019-03-28 12:43:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 20.64/10.25 [2019-03-28 12:43:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 20.64/10.25 [2019-03-28 12:43:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.64/10.25 [2019-03-28 12:43:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 20.64/10.25 [2019-03-28 12:43:35,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 20.64/10.25 [2019-03-28 12:43:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,453 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. 20.64/10.25 [2019-03-28 12:43:35,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.64/10.25 [2019-03-28 12:43:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. 20.64/10.25 [2019-03-28 12:43:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 20.64/10.25 [2019-03-28 12:43:35,454 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,454 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1364414191, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.64/10.25 [2019-03-28 12:43:35,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.64/10.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.64/10.25 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.64/10.25 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.64/10.25 [2019-03-28 12:43:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core 20.64/10.25 [2019-03-28 12:43:35,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.64/10.25 [2019-03-28 12:43:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 20.64/10.25 [2019-03-28 12:43:35,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 20.64/10.25 [2019-03-28 12:43:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 20.64/10.25 [2019-03-28 12:43:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 20.64/10.25 [2019-03-28 12:43:35,575 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 6 states. 20.64/10.25 [2019-03-28 12:43:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,626 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. 20.64/10.25 [2019-03-28 12:43:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 20.64/10.25 [2019-03-28 12:43:35,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 20.64/10.25 [2019-03-28 12:43:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,627 INFO L225 Difference]: With dead ends: 10 20.64/10.25 [2019-03-28 12:43:35,627 INFO L226 Difference]: Without dead ends: 9 20.64/10.25 [2019-03-28 12:43:35,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 20.64/10.25 [2019-03-28 12:43:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. 20.64/10.25 [2019-03-28 12:43:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 20.64/10.25 [2019-03-28 12:43:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.64/10.25 [2019-03-28 12:43:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. 20.64/10.25 [2019-03-28 12:43:35,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 20.64/10.25 [2019-03-28 12:43:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,631 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. 20.64/10.25 [2019-03-28 12:43:35,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 20.64/10.25 [2019-03-28 12:43:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. 20.64/10.25 [2019-03-28 12:43:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 20.64/10.25 [2019-03-28 12:43:35,631 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,632 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1364414192, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 20.64/10.25 [2019-03-28 12:43:35,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 20.64/10.25 [2019-03-28 12:43:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 20.64/10.25 [2019-03-28 12:43:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 20.64/10.25 [2019-03-28 12:43:35,743 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. 20.64/10.25 [2019-03-28 12:43:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:35,813 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. 20.64/10.25 [2019-03-28 12:43:35,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 20.64/10.25 [2019-03-28 12:43:35,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 20.64/10.25 [2019-03-28 12:43:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:35,814 INFO L225 Difference]: With dead ends: 15 20.64/10.25 [2019-03-28 12:43:35,815 INFO L226 Difference]: Without dead ends: 8 20.64/10.25 [2019-03-28 12:43:35,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 20.64/10.25 [2019-03-28 12:43:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 20.64/10.25 [2019-03-28 12:43:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 20.64/10.25 [2019-03-28 12:43:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.64/10.25 [2019-03-28 12:43:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. 20.64/10.25 [2019-03-28 12:43:35,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 20.64/10.25 [2019-03-28 12:43:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:35,818 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. 20.64/10.25 [2019-03-28 12:43:35,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 20.64/10.25 [2019-03-28 12:43:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. 20.64/10.25 [2019-03-28 12:43:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 20.64/10.25 [2019-03-28 12:43:35,819 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:35,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:35,819 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1822480608, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:35,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:35,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:35,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.64/10.25 [2019-03-28 12:43:35,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.64/10.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.64/10.25 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.64/10.25 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.64/10.25 [2019-03-28 12:43:35,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:36,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjunts are in the unsatisfiable core 20.64/10.25 [2019-03-28 12:43:36,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.64/10.25 [2019-03-28 12:43:36,049 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 20.64/10.25 [2019-03-28 12:43:36,049 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,059 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,061 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,061 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 20.64/10.25 [2019-03-28 12:43:36,095 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,095 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 20.64/10.25 [2019-03-28 12:43:36,099 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,113 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,121 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,122 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 20.64/10.25 [2019-03-28 12:43:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:36,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:36,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 20.64/10.25 [2019-03-28 12:43:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 20.64/10.25 [2019-03-28 12:43:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 20.64/10.25 [2019-03-28 12:43:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 20.64/10.25 [2019-03-28 12:43:36,186 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 9 states. 20.64/10.25 [2019-03-28 12:43:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:36,418 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. 20.64/10.25 [2019-03-28 12:43:36,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 20.64/10.25 [2019-03-28 12:43:36,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 20.64/10.25 [2019-03-28 12:43:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:36,419 INFO L225 Difference]: With dead ends: 11 20.64/10.25 [2019-03-28 12:43:36,419 INFO L226 Difference]: Without dead ends: 10 20.64/10.25 [2019-03-28 12:43:36,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 20.64/10.25 [2019-03-28 12:43:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. 20.64/10.25 [2019-03-28 12:43:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 20.64/10.25 [2019-03-28 12:43:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.64/10.25 [2019-03-28 12:43:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. 20.64/10.25 [2019-03-28 12:43:36,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 20.64/10.25 [2019-03-28 12:43:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:36,423 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. 20.64/10.25 [2019-03-28 12:43:36,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 20.64/10.25 [2019-03-28 12:43:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. 20.64/10.25 [2019-03-28 12:43:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 20.64/10.25 [2019-03-28 12:43:36,424 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:36,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:36,424 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:36,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash -942818353, now seen corresponding path program 2 times 20.64/10.25 [2019-03-28 12:43:36,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:36,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:36,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:36,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:36,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.64/10.25 [2019-03-28 12:43:36,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.64/10.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.64/10.25 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.64/10.25 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.64/10.25 [2019-03-28 12:43:36,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 20.64/10.25 [2019-03-28 12:43:36,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 20.64/10.25 [2019-03-28 12:43:36,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:36,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 22 conjunts are in the unsatisfiable core 20.64/10.25 [2019-03-28 12:43:36,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.64/10.25 [2019-03-28 12:43:36,625 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 20.64/10.25 [2019-03-28 12:43:36,625 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,630 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,630 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 20.64/10.25 [2019-03-28 12:43:36,647 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 20.64/10.25 [2019-03-28 12:43:36,648 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,653 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,654 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,654 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 20.64/10.25 [2019-03-28 12:43:36,685 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,686 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 20.64/10.25 [2019-03-28 12:43:36,687 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,697 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:36,700 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:36,700 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 20.64/10.25 [2019-03-28 12:43:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:36,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 20.64/10.25 [2019-03-28 12:43:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 20.64/10.25 [2019-03-28 12:43:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 20.64/10.25 [2019-03-28 12:43:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 20.64/10.25 [2019-03-28 12:43:36,765 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. 20.64/10.25 [2019-03-28 12:43:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:37,113 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. 20.64/10.25 [2019-03-28 12:43:37,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 20.64/10.25 [2019-03-28 12:43:37,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 20.64/10.25 [2019-03-28 12:43:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:37,114 INFO L225 Difference]: With dead ends: 14 20.64/10.25 [2019-03-28 12:43:37,114 INFO L226 Difference]: Without dead ends: 13 20.64/10.25 [2019-03-28 12:43:37,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 20.64/10.25 [2019-03-28 12:43:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 20.64/10.25 [2019-03-28 12:43:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. 20.64/10.25 [2019-03-28 12:43:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 20.64/10.25 [2019-03-28 12:43:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:37,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 20.64/10.25 [2019-03-28 12:43:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 20.64/10.25 [2019-03-28 12:43:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 20.64/10.25 [2019-03-28 12:43:37,119 INFO L394 BasicCegarLoop]: Found error trace 20.64/10.25 [2019-03-28 12:43:37,120 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:37,120 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.64/10.25 [2019-03-28 12:43:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 189636381, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:37,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:37,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.64/10.25 [2019-03-28 12:43:37,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.64/10.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.64/10.25 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.64/10.25 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.64/10.25 [2019-03-28 12:43:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:37,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core 20.64/10.25 [2019-03-28 12:43:37,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.64/10.25 [2019-03-28 12:43:37,259 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 20.64/10.25 [2019-03-28 12:43:37,259 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:37,265 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:37,265 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:37,265 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 20.64/10.25 [2019-03-28 12:43:37,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 20.64/10.25 [2019-03-28 12:43:37,272 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:37,276 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:37,276 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:37,276 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 20.64/10.25 [2019-03-28 12:43:37,294 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:37,295 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 20.64/10.25 [2019-03-28 12:43:37,296 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 20.64/10.25 [2019-03-28 12:43:37,304 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.64/10.25 [2019-03-28 12:43:37,304 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 20.64/10.25 [2019-03-28 12:43:37,305 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 20.64/10.25 [2019-03-28 12:43:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:37,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 20.64/10.25 [2019-03-28 12:43:37,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 20.64/10.25 [2019-03-28 12:43:37,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 20.64/10.25 [2019-03-28 12:43:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 20.64/10.25 [2019-03-28 12:43:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 20.64/10.25 [2019-03-28 12:43:37,362 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. 20.64/10.25 [2019-03-28 12:43:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.64/10.25 [2019-03-28 12:43:37,431 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. 20.64/10.25 [2019-03-28 12:43:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 20.64/10.25 [2019-03-28 12:43:37,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 20.64/10.25 [2019-03-28 12:43:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.64/10.25 [2019-03-28 12:43:37,432 INFO L225 Difference]: With dead ends: 12 20.64/10.25 [2019-03-28 12:43:37,432 INFO L226 Difference]: Without dead ends: 0 20.64/10.25 [2019-03-28 12:43:37,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 20.64/10.25 [2019-03-28 12:43:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 20.64/10.25 [2019-03-28 12:43:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 20.64/10.25 [2019-03-28 12:43:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 20.64/10.25 [2019-03-28 12:43:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:37,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 20.64/10.25 [2019-03-28 12:43:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. 20.64/10.25 [2019-03-28 12:43:37,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:37,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 20.64/10.25 [2019-03-28 12:43:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:37,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.64/10.25 [2019-03-28 12:43:37,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:37,627 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 20.64/10.25 [2019-03-28 12:43:37,630 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,630 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,630 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,630 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,630 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,631 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,631 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 14) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 15) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,632 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 14) the Hoare annotation is: (let ((.cse10 (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base)) (.cse9 (select |#length| ULTIMATE.start_cstrlen_~p~0.base))) (let ((.cse7 (<= (+ ULTIMATE.start_cstrlen_~p~0.offset 1) .cse9)) (.cse3 (= 0 (select .cse10 (+ .cse9 (- 1))))) (.cse0 (= 0 ULTIMATE.start_cstrlen_~p~0.offset)) (.cse4 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse6 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse1 (= ULTIMATE.start_main_~length1~0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (.cse2 (= (select |#valid| ULTIMATE.start_cstrlen_~p~0.base) 1)) (.cse8 (= ULTIMATE.start_cstrlen_~p~0.base ULTIMATE.start_cstrlen_~s.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= 1 ULTIMATE.start_cstrlen_~p~0.offset) .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 .cse8 .cse3) (and .cse0 .cse4 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) 1) .cse5 (<= 1 .cse9) .cse6 .cse1 .cse2 (= (select .cse10 ULTIMATE.start_cstrlen_~p~0.offset) 0) .cse8)))) 20.64/10.25 [2019-03-28 12:43:37,632 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 14) no Hoare annotation was computed. 20.64/10.25 [2019-03-28 12:43:37,632 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 20.64/10.25 [2019-03-28 12:43:37,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:37,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:37,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,646 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:37,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:37,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:37,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:37,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:37,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:37 BasicIcfg 20.64/10.25 [2019-03-28 12:43:37,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.64/10.25 [2019-03-28 12:43:37,660 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.64/10.25 [2019-03-28 12:43:37,660 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.64/10.25 [2019-03-28 12:43:37,663 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.64/10.25 [2019-03-28 12:43:37,664 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.64/10.25 [2019-03-28 12:43:37,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:43:33" (1/5) ... 20.64/10.25 [2019-03-28 12:43:37,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c5c2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:37, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:37,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.64/10.25 [2019-03-28 12:43:37,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:34" (2/5) ... 20.64/10.25 [2019-03-28 12:43:37,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c5c2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:37, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:37,666 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.64/10.25 [2019-03-28 12:43:37,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:34" (3/5) ... 20.64/10.25 [2019-03-28 12:43:37,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c5c2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:37, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:37,666 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.64/10.25 [2019-03-28 12:43:37,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:34" (4/5) ... 20.64/10.25 [2019-03-28 12:43:37,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c5c2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:37, skipping insertion in model container 20.64/10.25 [2019-03-28 12:43:37,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.64/10.25 [2019-03-28 12:43:37,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:37" (5/5) ... 20.64/10.25 [2019-03-28 12:43:37,668 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.64/10.25 [2019-03-28 12:43:37,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.64/10.25 [2019-03-28 12:43:37,689 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.64/10.25 [2019-03-28 12:43:37,689 INFO L375 BuchiCegarLoop]: Hoare is true 20.64/10.25 [2019-03-28 12:43:37,689 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.64/10.25 [2019-03-28 12:43:37,689 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.64/10.25 [2019-03-28 12:43:37,689 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.64/10.25 [2019-03-28 12:43:37,689 INFO L379 BuchiCegarLoop]: Difference is false 20.64/10.25 [2019-03-28 12:43:37,689 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.64/10.25 [2019-03-28 12:43:37,689 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.64/10.25 [2019-03-28 12:43:37,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 20.64/10.25 [2019-03-28 12:43:37,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.64/10.25 [2019-03-28 12:43:37,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.64/10.25 [2019-03-28 12:43:37,698 INFO L119 BuchiIsEmpty]: Starting construction of run 20.64/10.25 [2019-03-28 12:43:37,702 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:37,702 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.64/10.25 [2019-03-28 12:43:37,702 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.64/10.25 [2019-03-28 12:43:37,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 20.64/10.25 [2019-03-28 12:43:37,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.64/10.25 [2019-03-28 12:43:37,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.64/10.25 [2019-03-28 12:43:37,704 INFO L119 BuchiIsEmpty]: Starting construction of run 20.64/10.25 [2019-03-28 12:43:37,704 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.64/10.25 [2019-03-28 12:43:37,704 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.64/10.25 [2019-03-28 12:43:37,709 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue [95] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 14#L20true [56] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 9#L20-2true [66] L20-2-->L24: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc3.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_4|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc3.base_4| |v_#StackHeapBarrier_1|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 11#L24true [96] L24-->L13-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlen_#in~s.offset_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_cstrlen_~s.base_5) (= |v_ULTIMATE.start_cstrlen_#in~s.offset_2| v_ULTIMATE.start_cstrlen_~s.offset_4) (<= 1 .cse0) (= (store |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8 (store (select |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11 (- 1)) 0)) |v_#memory_int_4|) (= v_ULTIMATE.start_cstrlen_~s.base_5 v_ULTIMATE.start_cstrlen_~p~0.base_10) (<= .cse0 (select |v_#length_7| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrlen_~p~0.offset_8 v_ULTIMATE.start_cstrlen_~s.offset_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_8, ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_7|, ULTIMATE.start_cstrlen_~s.base=v_ULTIMATE.start_cstrlen_~s.base_5, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, ULTIMATE.start_cstrlen_#in~s.base=|v_ULTIMATE.start_cstrlen_#in~s.base_2|, ULTIMATE.start_cstrlen_~s.offset=v_ULTIMATE.start_cstrlen_~s.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_10, ULTIMATE.start_cstrlen_#in~s.offset=|v_ULTIMATE.start_cstrlen_#in~s.offset_2|, ULTIMATE.start_cstrlen_#t~post1.offset=|v_ULTIMATE.start_cstrlen_#t~post1.offset_4|, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrlen_#t~post1.base=|v_ULTIMATE.start_cstrlen_#t~post1.base_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~mem0, ULTIMATE.start_cstrlen_~s.base, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#in~s.offset, ULTIMATE.start_cstrlen_#t~post1.offset, ULTIMATE.start_cstrlen_#res, #memory_int, ULTIMATE.start_cstrlen_#t~post1.base, ULTIMATE.start_cstrlen_#in~s.base, ULTIMATE.start_cstrlen_~s.offset] 4#L13-3true 20.64/10.25 [2019-03-28 12:43:37,710 INFO L796 eck$LassoCheckResult]: Loop: 4#L13-3true [44] L13-3-->L13-1: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrlen_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrlen_~p~0.offset_3) (= |v_ULTIMATE.start_cstrlen_#t~mem0_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~p~0.base_3) v_ULTIMATE.start_cstrlen_~p~0.offset_3)) (<= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~p~0.base_3))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_3, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_3, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_2|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_3, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem0] 7#L13-1true [93] L13-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cstrlen_~p~0.base_7 v_ULTIMATE.start_cstrlen_~p~0.base_6) (= v_ULTIMATE.start_cstrlen_~p~0.offset_5 (+ v_ULTIMATE.start_cstrlen_~p~0.offset_6 1)) (< 0 |v_ULTIMATE.start_cstrlen_#t~mem0_6|)) InVars {ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_6|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_6, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_7} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_5, ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_5|, ULTIMATE.start_cstrlen_#t~post1.base=|v_ULTIMATE.start_cstrlen_#t~post1.base_2|, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_6, ULTIMATE.start_cstrlen_#t~post1.offset=|v_ULTIMATE.start_cstrlen_#t~post1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~mem0, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#t~post1.offset, ULTIMATE.start_cstrlen_#t~post1.base] 4#L13-3true 20.64/10.25 [2019-03-28 12:43:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash 3809624, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:37,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.64/10.25 [2019-03-28 12:43:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.64/10.25 [2019-03-28 12:43:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2418, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:37,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.64/10.25 [2019-03-28 12:43:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.64/10.25 [2019-03-28 12:43:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -633917175, now seen corresponding path program 1 times 20.64/10.25 [2019-03-28 12:43:37,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.64/10.25 [2019-03-28 12:43:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.64/10.25 [2019-03-28 12:43:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.64/10.25 [2019-03-28 12:43:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.64/10.25 [2019-03-28 12:43:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.64/10.25 [2019-03-28 12:43:37,941 INFO L216 LassoAnalysis]: Preferences: 20.64/10.25 [2019-03-28 12:43:37,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.64/10.25 [2019-03-28 12:43:37,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.64/10.25 [2019-03-28 12:43:37,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.64/10.25 [2019-03-28 12:43:37,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.64/10.25 [2019-03-28 12:43:37,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.64/10.25 [2019-03-28 12:43:37,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.64/10.25 [2019-03-28 12:43:37,943 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.64/10.25 [2019-03-28 12:43:37,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 20.64/10.25 [2019-03-28 12:43:37,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.64/10.25 [2019-03-28 12:43:37,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.64/10.25 [2019-03-28 12:43:37,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:37,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:37,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:37,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:37,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:38,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:38,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:38,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:38,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:38,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.64/10.25 [2019-03-28 12:43:38,329 INFO L300 LassoAnalysis]: Preprocessing complete. 20.64/10.25 [2019-03-28 12:43:38,335 INFO L497 LassoAnalysis]: Using template 'affine'. 20.64/10.25 [2019-03-28 12:43:38,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.64/10.25 [2019-03-28 12:43:38,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.64/10.25 [2019-03-28 12:43:38,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.64/10.25 [2019-03-28 12:43:38,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.64/10.25 [2019-03-28 12:43:38,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.64/10.25 [2019-03-28 12:43:38,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.64/10.25 Termination analysis: LINEAR_WITH_GUESSES 20.64/10.25 Number of strict supporting invariants: 0 20.64/10.25 Number of non-strict supporting invariants: 1 20.64/10.25 Consider only non-deceasing supporting invariants: true 20.64/10.25 Simplify termination arguments: true 20.64/10.25 Simplify supporting invariants: trueOverapproximate stem: false 20.64/10.25 [2019-03-28 12:43:38,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.64/10.25 [2019-03-28 12:43:38,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.64/10.25 [2019-03-28 12:43:38,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.64/10.25 [2019-03-28 12:43:38,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.64/10.25 [2019-03-28 12:43:38,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.64/10.25 [2019-03-28 12:43:38,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.64/10.25 [2019-03-28 12:43:38,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.64/10.25 [2019-03-28 12:43:38,443 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.64/10.25 [2019-03-28 12:43:38,443 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 20.64/10.25 [2019-03-28 12:43:38,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.64/10.25 [2019-03-28 12:43:38,447 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 20.64/10.25 [2019-03-28 12:43:38,448 INFO L518 LassoAnalysis]: Proved termination. 20.64/10.25 [2019-03-28 12:43:38,448 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.64/10.25 Ranking function f(ULTIMATE.start_cstrlen_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_1) = -1*ULTIMATE.start_cstrlen_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_1 20.64/10.25 Supporting invariants [] 20.64/10.25 [2019-03-28 12:43:38,467 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 20.64/10.25 [2019-03-28 12:43:38,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.64/10.25 [2019-03-28 12:43:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:38,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core 20.64/10.25 [2019-03-28 12:43:38,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.64/10.25 [2019-03-28 12:43:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.64/10.25 [2019-03-28 12:43:38,526 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core 20.64/10.25 [2019-03-28 12:43:38,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.64/10.25 [2019-03-28 12:43:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.64/10.25 [2019-03-28 12:43:38,588 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.64/10.25 [2019-03-28 12:43:38,592 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates 20.64/10.25 [2019-03-28 12:43:38,593 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. 20.64/10.25 [2019-03-28 12:43:38,664 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 7 states. 20.64/10.25 [2019-03-28 12:43:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 20.64/10.25 [2019-03-28 12:43:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.64/10.25 [2019-03-28 12:43:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. 20.64/10.25 [2019-03-28 12:43:38,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. 20.64/10.25 [2019-03-28 12:43:38,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.64/10.25 [2019-03-28 12:43:38,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. 20.64/10.25 [2019-03-28 12:43:38,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.64/10.25 [2019-03-28 12:43:38,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. 20.64/10.25 [2019-03-28 12:43:38,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.64/10.25 [2019-03-28 12:43:38,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. 20.64/10.25 [2019-03-28 12:43:38,677 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.64/10.25 [2019-03-28 12:43:38,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:38,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.64/10.25 [2019-03-28 12:43:38,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.64/10.25 [2019-03-28 12:43:38,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:38,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.64/10.25 [2019-03-28 12:43:38,679 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:38,679 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:38,679 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:38,679 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.64/10.25 [2019-03-28 12:43:38,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.64/10.25 [2019-03-28 12:43:38,679 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.64/10.25 [2019-03-28 12:43:38,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.64/10.25 [2019-03-28 12:43:38,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:38 BasicIcfg 20.64/10.25 [2019-03-28 12:43:38,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.64/10.25 [2019-03-28 12:43:38,686 INFO L168 Benchmark]: Toolchain (without parser) took 4953.12 ms. Allocated memory was 649.6 MB in the beginning and 767.6 MB in the end (delta: 118.0 MB). Free memory was 563.9 MB in the beginning and 712.8 MB in the end (delta: -148.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,686 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.43 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 563.9 MB in the beginning and 652.3 MB in the end (delta: -88.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.57 ms. Allocated memory is still 687.9 MB. Free memory was 652.3 MB in the beginning and 651.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,688 INFO L168 Benchmark]: Boogie Preprocessor took 28.78 ms. Allocated memory is still 687.9 MB. Free memory was 651.0 MB in the beginning and 649.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,688 INFO L168 Benchmark]: RCFGBuilder took 275.68 ms. Allocated memory is still 687.9 MB. Free memory was 648.3 MB in the beginning and 631.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,689 INFO L168 Benchmark]: BlockEncodingV2 took 118.03 ms. Allocated memory is still 687.9 MB. Free memory was 631.0 MB in the beginning and 623.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,690 INFO L168 Benchmark]: TraceAbstraction took 3141.90 ms. Allocated memory was 687.9 MB in the beginning and 764.4 MB in the end (delta: 76.5 MB). Free memory was 623.0 MB in the beginning and 550.6 MB in the end (delta: 72.4 MB). Peak memory consumption was 148.9 MB. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,691 INFO L168 Benchmark]: BuchiAutomizer took 1025.30 ms. Allocated memory was 764.4 MB in the beginning and 767.6 MB in the end (delta: 3.1 MB). Free memory was 550.6 MB in the beginning and 712.8 MB in the end (delta: -162.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 20.64/10.25 [2019-03-28 12:43:38,695 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.64/10.25 --- Results --- 20.64/10.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.64/10.25 - StatisticsResult: Initial Icfg 20.64/10.25 18 locations, 20 edges 20.64/10.25 - StatisticsResult: Encoded RCFG 20.64/10.25 12 locations, 20 edges 20.64/10.25 * Results from de.uni_freiburg.informatik.ultimate.core: 20.64/10.25 - StatisticsResult: Toolchain Benchmarks 20.64/10.25 Benchmark results are: 20.64/10.25 * CDTParser took 0.20 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.64/10.25 * CACSL2BoogieTranslator took 314.43 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 563.9 MB in the beginning and 652.3 MB in the end (delta: -88.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 20.64/10.25 * Boogie Procedure Inliner took 43.57 ms. Allocated memory is still 687.9 MB. Free memory was 652.3 MB in the beginning and 651.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.64/10.25 * Boogie Preprocessor took 28.78 ms. Allocated memory is still 687.9 MB. Free memory was 651.0 MB in the beginning and 649.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.64/10.25 * RCFGBuilder took 275.68 ms. Allocated memory is still 687.9 MB. Free memory was 648.3 MB in the beginning and 631.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 50.3 GB. 20.64/10.25 * BlockEncodingV2 took 118.03 ms. Allocated memory is still 687.9 MB. Free memory was 631.0 MB in the beginning and 623.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 20.64/10.25 * TraceAbstraction took 3141.90 ms. Allocated memory was 687.9 MB in the beginning and 764.4 MB in the end (delta: 76.5 MB). Free memory was 623.0 MB in the beginning and 550.6 MB in the end (delta: 72.4 MB). Peak memory consumption was 148.9 MB. Max. memory is 50.3 GB. 20.64/10.25 * BuchiAutomizer took 1025.30 ms. Allocated memory was 764.4 MB in the beginning and 767.6 MB in the end (delta: 3.1 MB). Free memory was 550.6 MB in the beginning and 712.8 MB in the end (delta: -162.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 20.64/10.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #memory_int 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #memory_int 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #memory_int 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #memory_int 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #memory_int 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #memory_int 20.64/10.25 - GenericResult: Unfinished Backtranslation 20.64/10.25 unknown boogie variable #length 20.64/10.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.64/10.25 - PositiveResult [Line: 24]: pointer dereference always succeeds 20.64/10.25 For all program executions holds that pointer dereference always succeeds at this location 20.64/10.25 - PositiveResult [Line: 13]: pointer dereference always succeeds 20.64/10.25 For all program executions holds that pointer dereference always succeeds at this location 20.64/10.25 - PositiveResult [Line: 13]: pointer dereference always succeeds 20.64/10.25 For all program executions holds that pointer dereference always succeeds at this location 20.64/10.25 - PositiveResult [Line: 15]: pointer arithmetic is always legal 20.64/10.25 For all program executions holds that pointer arithmetic is always legal at this location 20.64/10.25 - PositiveResult [Line: 24]: pointer dereference always succeeds 20.64/10.25 For all program executions holds that pointer dereference always succeeds at this location 20.64/10.25 - AllSpecificationsHoldResult: All specifications hold 20.64/10.25 5 specifications checked. All of them hold 20.64/10.25 - InvariantResult [Line: 13]: Loop Invariant 20.64/10.25 [2019-03-28 12:43:38,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:38,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:38,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:38,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:38,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 [2019-03-28 12:43:38,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.64/10.25 [2019-03-28 12:43:38,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.64/10.25 Derived loop invariant: (((((((((0 == p && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && p + 1 <= unknown-#length-unknown[p]) && p == s) || ((((((((1 <= p && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && p + 1 <= unknown-#length-unknown[p]) && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && p == s) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1])) || (((((((((0 == p && 1 <= length1) && nondetString1 + length1 <= 1) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[p]) && nondetString1 == 0) && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && unknown-#memory_int-unknown[p][p] == 0) && p == s) 20.64/10.25 - StatisticsResult: Ultimate Automizer benchmark data 20.64/10.25 CFG has 1 procedures, 12 locations, 5 error locations. SAFE Result, 3.0s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 147 SDslu, 74 SDs, 0 SdLazy, 308 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 138 HoareAnnotationTreeSize, 1 FomulaSimplifications, 130 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 93 ConstructedInterpolants, 4 QuantifiedInterpolants, 4853 SizeOfPredicates, 25 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 9/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 20.64/10.25 - StatisticsResult: Constructed decomposition of program 20.64/10.25 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 5 locations. 20.64/10.25 - StatisticsResult: Timing statistics 20.64/10.25 BüchiAutomizer plugin needed 0.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 54 SDslu, 3 SDs, 0 SdLazy, 41 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital111 mio100 ax100 hnf100 lsp94 ukn91 mio100 lsp46 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 20.64/10.25 - TerminationAnalysisResult: Termination proven 20.64/10.25 Buchi Automizer proved that your program is terminating 20.64/10.25 RESULT: Ultimate proved your program to be correct! 20.64/10.25 !SESSION 2019-03-28 12:43:29.578 ----------------------------------------------- 20.64/10.25 eclipse.buildId=unknown 20.64/10.25 java.version=1.8.0_181 20.64/10.25 java.vendor=Oracle Corporation 20.64/10.25 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.64/10.25 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.64/10.25 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.64/10.25 20.64/10.25 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:43:38.938 20.64/10.25 !MESSAGE The workspace will exit with unsaved changes in this session. 20.64/10.25 Received shutdown request... 20.64/10.25 Ultimate: 20.64/10.25 GTK+ Version Check 20.64/10.25 EOF