15.75/10.32 YES 15.75/10.32 15.75/10.32 Ultimate: Cannot open display: 15.75/10.32 This is Ultimate 0.1.24-8dc7c08-m 15.75/10.32 [2019-03-28 12:41:01,616 INFO L170 SettingsManager]: Resetting all preferences to default values... 15.75/10.32 [2019-03-28 12:41:01,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 15.75/10.32 [2019-03-28 12:41:01,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 15.75/10.32 [2019-03-28 12:41:01,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 15.75/10.32 [2019-03-28 12:41:01,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 15.75/10.32 [2019-03-28 12:41:01,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 15.75/10.32 [2019-03-28 12:41:01,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 15.75/10.32 [2019-03-28 12:41:01,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 15.75/10.32 [2019-03-28 12:41:01,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 15.75/10.32 [2019-03-28 12:41:01,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 15.75/10.32 [2019-03-28 12:41:01,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 15.75/10.32 [2019-03-28 12:41:01,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 15.75/10.32 [2019-03-28 12:41:01,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 15.75/10.32 [2019-03-28 12:41:01,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 15.75/10.32 [2019-03-28 12:41:01,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 15.75/10.32 [2019-03-28 12:41:01,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 15.75/10.32 [2019-03-28 12:41:01,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 15.75/10.32 [2019-03-28 12:41:01,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 15.75/10.32 [2019-03-28 12:41:01,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 15.75/10.32 [2019-03-28 12:41:01,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,650 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 15.75/10.32 [2019-03-28 12:41:01,651 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 15.75/10.32 [2019-03-28 12:41:01,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 15.75/10.32 [2019-03-28 12:41:01,652 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 15.75/10.32 [2019-03-28 12:41:01,653 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 15.75/10.32 [2019-03-28 12:41:01,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 15.75/10.32 [2019-03-28 12:41:01,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 15.75/10.32 [2019-03-28 12:41:01,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 15.75/10.32 [2019-03-28 12:41:01,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 15.75/10.32 [2019-03-28 12:41:01,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 15.75/10.32 [2019-03-28 12:41:01,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 15.75/10.32 [2019-03-28 12:41:01,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 15.75/10.32 [2019-03-28 12:41:01,659 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 15.75/10.32 [2019-03-28 12:41:01,674 INFO L110 SettingsManager]: Loading preferences was successful 15.75/10.32 [2019-03-28 12:41:01,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 15.75/10.32 [2019-03-28 12:41:01,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 15.75/10.32 [2019-03-28 12:41:01,675 INFO L133 SettingsManager]: * Rewrite not-equals=true 15.75/10.32 [2019-03-28 12:41:01,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 15.75/10.32 [2019-03-28 12:41:01,676 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 15.75/10.32 [2019-03-28 12:41:01,676 INFO L133 SettingsManager]: * Use SBE=true 15.75/10.32 [2019-03-28 12:41:01,676 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 15.75/10.32 [2019-03-28 12:41:01,676 INFO L133 SettingsManager]: * Use old map elimination=false 15.75/10.32 [2019-03-28 12:41:01,676 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 15.75/10.32 [2019-03-28 12:41:01,677 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 15.75/10.32 [2019-03-28 12:41:01,677 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 15.75/10.32 [2019-03-28 12:41:01,677 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 15.75/10.32 [2019-03-28 12:41:01,677 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 15.75/10.32 [2019-03-28 12:41:01,677 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.75/10.32 [2019-03-28 12:41:01,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 15.75/10.32 [2019-03-28 12:41:01,678 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 15.75/10.32 [2019-03-28 12:41:01,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE 15.75/10.32 [2019-03-28 12:41:01,678 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 15.75/10.32 [2019-03-28 12:41:01,678 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 15.75/10.32 [2019-03-28 12:41:01,678 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 15.75/10.32 [2019-03-28 12:41:01,679 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 15.75/10.32 [2019-03-28 12:41:01,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 15.75/10.32 [2019-03-28 12:41:01,679 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 15.75/10.32 [2019-03-28 12:41:01,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.75/10.32 [2019-03-28 12:41:01,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 15.75/10.32 [2019-03-28 12:41:01,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 15.75/10.32 [2019-03-28 12:41:01,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 15.75/10.32 [2019-03-28 12:41:01,680 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 15.75/10.32 [2019-03-28 12:41:01,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 15.75/10.32 [2019-03-28 12:41:01,719 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 15.75/10.32 [2019-03-28 12:41:01,723 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 15.75/10.32 [2019-03-28 12:41:01,724 INFO L271 PluginConnector]: Initializing CDTParser... 15.75/10.32 [2019-03-28 12:41:01,725 INFO L276 PluginConnector]: CDTParser initialized 15.75/10.32 [2019-03-28 12:41:01,726 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 15.75/10.32 [2019-03-28 12:41:01,880 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/f125fabc41a54f4cabdcc487f8188f68/FLAG78138ebe8 15.75/10.32 [2019-03-28 12:41:02,396 INFO L307 CDTParser]: Found 1 translation units. 15.75/10.32 [2019-03-28 12:41:02,397 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 15.75/10.32 [2019-03-28 12:41:02,397 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 15.75/10.32 [2019-03-28 12:41:02,403 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/f125fabc41a54f4cabdcc487f8188f68/FLAG78138ebe8 15.75/10.32 [2019-03-28 12:41:04,223 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/f125fabc41a54f4cabdcc487f8188f68 15.75/10.32 [2019-03-28 12:41:04,235 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 15.75/10.32 [2019-03-28 12:41:04,237 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 15.75/10.32 [2019-03-28 12:41:04,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 15.75/10.32 [2019-03-28 12:41:04,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 15.75/10.32 [2019-03-28 12:41:04,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 15.75/10.32 [2019-03-28 12:41:04,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560bd1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:04,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 15.75/10.32 [2019-03-28 12:41:04,272 INFO L176 MainTranslator]: Built tables and reachable declarations 15.75/10.32 [2019-03-28 12:41:04,435 INFO L206 PostProcessor]: Analyzing one entry point: main 15.75/10.32 [2019-03-28 12:41:04,449 INFO L191 MainTranslator]: Completed pre-run 15.75/10.32 [2019-03-28 12:41:04,466 INFO L206 PostProcessor]: Analyzing one entry point: main 15.75/10.32 [2019-03-28 12:41:04,548 INFO L195 MainTranslator]: Completed translation 15.75/10.32 [2019-03-28 12:41:04,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04 WrapperNode 15.75/10.32 [2019-03-28 12:41:04,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 15.75/10.32 [2019-03-28 12:41:04,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 15.75/10.32 [2019-03-28 12:41:04,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 15.75/10.32 [2019-03-28 12:41:04,550 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 15.75/10.32 [2019-03-28 12:41:04,561 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:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,570 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:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 15.75/10.32 [2019-03-28 12:41:04,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 15.75/10.32 [2019-03-28 12:41:04,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 15.75/10.32 [2019-03-28 12:41:04,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized 15.75/10.32 [2019-03-28 12:41:04,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 15.75/10.32 [2019-03-28 12:41:04,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 15.75/10.32 [2019-03-28 12:41:04,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... 15.75/10.32 [2019-03-28 12:41:04,620 INFO L276 PluginConnector]: RCFGBuilder initialized 15.75/10.32 [2019-03-28 12:41:04,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (1/1) ... 15.75/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.75/10.32 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 15.75/10.32 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.75/10.32 [2019-03-28 12:41:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 15.75/10.32 [2019-03-28 12:41:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 15.75/10.32 [2019-03-28 12:41:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 15.75/10.32 [2019-03-28 12:41:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 15.75/10.32 [2019-03-28 12:41:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 15.75/10.32 [2019-03-28 12:41:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 15.75/10.32 [2019-03-28 12:41:04,937 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 15.75/10.32 [2019-03-28 12:41:04,938 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 15.75/10.32 [2019-03-28 12:41:04,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:04 BoogieIcfgContainer 15.75/10.32 [2019-03-28 12:41:04,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 15.75/10.32 [2019-03-28 12:41:04,940 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 15.75/10.32 [2019-03-28 12:41:04,940 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 15.75/10.32 [2019-03-28 12:41:04,942 INFO L276 PluginConnector]: BlockEncodingV2 initialized 15.75/10.32 [2019-03-28 12:41:04,943 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:04" (1/1) ... 15.75/10.32 [2019-03-28 12:41:04,960 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 35 edges 15.75/10.32 [2019-03-28 12:41:04,962 INFO L258 BlockEncoder]: Using Remove infeasible edges 15.75/10.32 [2019-03-28 12:41:04,962 INFO L263 BlockEncoder]: Using Maximize final states 15.75/10.32 [2019-03-28 12:41:04,963 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 15.75/10.32 [2019-03-28 12:41:04,963 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 15.75/10.32 [2019-03-28 12:41:04,965 INFO L296 BlockEncoder]: Using Remove sink states 15.75/10.32 [2019-03-28 12:41:04,966 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 15.75/10.32 [2019-03-28 12:41:04,966 INFO L179 BlockEncoder]: Using Rewrite not-equals 15.75/10.32 [2019-03-28 12:41:04,989 INFO L185 BlockEncoder]: Using Use SBE 15.75/10.32 [2019-03-28 12:41:05,017 INFO L200 BlockEncoder]: SBE split 14 edges 15.75/10.32 [2019-03-28 12:41:05,023 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 15.75/10.32 [2019-03-28 12:41:05,024 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.75/10.32 [2019-03-28 12:41:05,074 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding 15.75/10.32 [2019-03-28 12:41:05,077 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 15.75/10.32 [2019-03-28 12:41:05,079 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.75/10.32 [2019-03-28 12:41:05,079 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.75/10.32 [2019-03-28 12:41:05,084 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 15.75/10.32 [2019-03-28 12:41:05,085 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.75/10.32 [2019-03-28 12:41:05,085 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.75/10.32 [2019-03-28 12:41:05,086 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.75/10.32 [2019-03-28 12:41:05,086 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 15.75/10.32 [2019-03-28 12:41:05,087 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.75/10.32 [2019-03-28 12:41:05,087 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 36 edges 15.75/10.32 [2019-03-28 12:41:05,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:05 BasicIcfg 15.75/10.32 [2019-03-28 12:41:05,088 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 15.75/10.32 [2019-03-28 12:41:05,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 15.75/10.32 [2019-03-28 12:41:05,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... 15.75/10.32 [2019-03-28 12:41:05,093 INFO L276 PluginConnector]: TraceAbstraction initialized 15.75/10.32 [2019-03-28 12:41:05,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:41:04" (1/4) ... 15.75/10.32 [2019-03-28 12:41:05,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a1d500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (2/4) ... 15.75/10.32 [2019-03-28 12:41:05,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a1d500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:04" (3/4) ... 15.75/10.32 [2019-03-28 12:41:05,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a1d500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:05" (4/4) ... 15.75/10.32 [2019-03-28 12:41:05,097 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.75/10.32 [2019-03-28 12:41:05,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 15.75/10.32 [2019-03-28 12:41:05,115 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. 15.75/10.32 [2019-03-28 12:41:05,132 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. 15.75/10.32 [2019-03-28 12:41:05,161 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.75/10.32 [2019-03-28 12:41:05,162 INFO L382 AbstractCegarLoop]: Interprodecural is true 15.75/10.32 [2019-03-28 12:41:05,162 INFO L383 AbstractCegarLoop]: Hoare is true 15.75/10.32 [2019-03-28 12:41:05,162 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 15.75/10.32 [2019-03-28 12:41:05,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 15.75/10.32 [2019-03-28 12:41:05,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.75/10.32 [2019-03-28 12:41:05,163 INFO L387 AbstractCegarLoop]: Difference is false 15.75/10.32 [2019-03-28 12:41:05,163 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 15.75/10.32 [2019-03-28 12:41:05,163 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 15.75/10.32 [2019-03-28 12:41:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. 15.75/10.32 [2019-03-28 12:41:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.75/10.32 [2019-03-28 12:41:05,184 INFO L394 BasicCegarLoop]: Found error trace 15.75/10.32 [2019-03-28 12:41:05,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,185 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 15.75/10.32 [2019-03-28 12:41:05,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.32 [2019-03-28 12:41:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash 100327, now seen corresponding path program 1 times 15.75/10.32 [2019-03-28 12:41:05,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.75/10.32 [2019-03-28 12:41:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.75/10.32 [2019-03-28 12:41:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.75/10.32 [2019-03-28 12:41:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.75/10.32 [2019-03-28 12:41:05,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.75/10.32 [2019-03-28 12:41:05,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.75/10.32 [2019-03-28 12:41:05,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.75/10.32 [2019-03-28 12:41:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.75/10.32 [2019-03-28 12:41:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.75/10.32 [2019-03-28 12:41:05,376 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. 15.75/10.32 [2019-03-28 12:41:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.75/10.32 [2019-03-28 12:41:05,471 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 15.75/10.32 [2019-03-28 12:41:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.75/10.32 [2019-03-28 12:41:05,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.75/10.32 [2019-03-28 12:41:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.75/10.32 [2019-03-28 12:41:05,485 INFO L225 Difference]: With dead ends: 21 15.75/10.32 [2019-03-28 12:41:05,485 INFO L226 Difference]: Without dead ends: 15 15.75/10.32 [2019-03-28 12:41:05,488 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 15.75/10.32 [2019-03-28 12:41:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 15.75/10.32 [2019-03-28 12:41:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. 15.75/10.32 [2019-03-28 12:41:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 15.75/10.32 [2019-03-28 12:41:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. 15.75/10.32 [2019-03-28 12:41:05,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 3 15.75/10.32 [2019-03-28 12:41:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. 15.75/10.32 [2019-03-28 12:41:05,527 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. 15.75/10.32 [2019-03-28 12:41:05,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.75/10.32 [2019-03-28 12:41:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. 15.75/10.32 [2019-03-28 12:41:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.75/10.32 [2019-03-28 12:41:05,528 INFO L394 BasicCegarLoop]: Found error trace 15.75/10.32 [2019-03-28 12:41:05,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,528 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 15.75/10.32 [2019-03-28 12:41:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.32 [2019-03-28 12:41:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 100329, now seen corresponding path program 1 times 15.75/10.32 [2019-03-28 12:41:05,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.75/10.32 [2019-03-28 12:41:05,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.75/10.32 [2019-03-28 12:41:05,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.75/10.32 [2019-03-28 12:41:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.75/10.32 [2019-03-28 12:41:05,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.75/10.32 [2019-03-28 12:41:05,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.75/10.32 [2019-03-28 12:41:05,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.75/10.32 [2019-03-28 12:41:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.75/10.32 [2019-03-28 12:41:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.75/10.32 [2019-03-28 12:41:05,551 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 3 states. 15.75/10.32 [2019-03-28 12:41:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.75/10.32 [2019-03-28 12:41:05,600 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. 15.75/10.32 [2019-03-28 12:41:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.75/10.32 [2019-03-28 12:41:05,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.75/10.32 [2019-03-28 12:41:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.75/10.32 [2019-03-28 12:41:05,602 INFO L225 Difference]: With dead ends: 21 15.75/10.32 [2019-03-28 12:41:05,602 INFO L226 Difference]: Without dead ends: 15 15.75/10.32 [2019-03-28 12:41:05,603 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 15.75/10.32 [2019-03-28 12:41:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 15.75/10.32 [2019-03-28 12:41:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. 15.75/10.32 [2019-03-28 12:41:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 15.75/10.32 [2019-03-28 12:41:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. 15.75/10.32 [2019-03-28 12:41:05,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 3 15.75/10.32 [2019-03-28 12:41:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. 15.75/10.32 [2019-03-28 12:41:05,607 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. 15.75/10.32 [2019-03-28 12:41:05,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.75/10.32 [2019-03-28 12:41:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. 15.75/10.32 [2019-03-28 12:41:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.75/10.32 [2019-03-28 12:41:05,608 INFO L394 BasicCegarLoop]: Found error trace 15.75/10.32 [2019-03-28 12:41:05,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,608 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 15.75/10.32 [2019-03-28 12:41:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.32 [2019-03-28 12:41:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 100330, now seen corresponding path program 1 times 15.75/10.32 [2019-03-28 12:41:05,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.75/10.32 [2019-03-28 12:41:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.75/10.32 [2019-03-28 12:41:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.75/10.32 [2019-03-28 12:41:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.75/10.32 [2019-03-28 12:41:05,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.75/10.32 [2019-03-28 12:41:05,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.75/10.32 [2019-03-28 12:41:05,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.75/10.32 [2019-03-28 12:41:05,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.75/10.32 [2019-03-28 12:41:05,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.75/10.32 [2019-03-28 12:41:05,646 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 3 states. 15.75/10.32 [2019-03-28 12:41:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.75/10.32 [2019-03-28 12:41:05,680 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. 15.75/10.32 [2019-03-28 12:41:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.75/10.32 [2019-03-28 12:41:05,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.75/10.32 [2019-03-28 12:41:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.75/10.32 [2019-03-28 12:41:05,681 INFO L225 Difference]: With dead ends: 15 15.75/10.32 [2019-03-28 12:41:05,681 INFO L226 Difference]: Without dead ends: 0 15.75/10.32 [2019-03-28 12:41:05,682 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 15.75/10.32 [2019-03-28 12:41:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 15.75/10.32 [2019-03-28 12:41:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 15.75/10.32 [2019-03-28 12:41:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 15.75/10.32 [2019-03-28 12:41:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 15.75/10.32 [2019-03-28 12:41:05,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 15.75/10.32 [2019-03-28 12:41:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. 15.75/10.32 [2019-03-28 12:41:05,683 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 15.75/10.32 [2019-03-28 12:41:05,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.75/10.32 [2019-03-28 12:41:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 15.75/10.32 [2019-03-28 12:41:05,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 15.75/10.32 [2019-03-28 12:41:05,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 15.75/10.32 [2019-03-28 12:41:05,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,707 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,708 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,708 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,708 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 15 21) the Hoare annotation is: (and (= (select |#valid| ~x~0.base) 1) (= ~x~0.offset 0) (= (select |#length| ~x~0.base) 4)) 15.75/10.32 [2019-03-28 12:41:05,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,710 INFO L448 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,710 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,710 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,710 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,710 INFO L448 ceAbstractionStarter]: For program point L8-6(line 8) no Hoare annotation was computed. 15.75/10.32 [2019-03-28 12:41:05,711 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 15.75/10.32 [2019-03-28 12:41:05,719 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.75/10.32 [2019-03-28 12:41:05,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.75/10.32 [2019-03-28 12:41:05,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:05 BasicIcfg 15.75/10.32 [2019-03-28 12:41:05,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 15.75/10.32 [2019-03-28 12:41:05,728 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 15.75/10.32 [2019-03-28 12:41:05,728 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 15.75/10.32 [2019-03-28 12:41:05,731 INFO L276 PluginConnector]: BuchiAutomizer initialized 15.75/10.32 [2019-03-28 12:41:05,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.75/10.32 [2019-03-28 12:41:05,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:41:04" (1/5) ... 15.75/10.32 [2019-03-28 12:41:05,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fd686bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.75/10.32 [2019-03-28 12:41:05,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:04" (2/5) ... 15.75/10.32 [2019-03-28 12:41:05,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fd686bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.75/10.32 [2019-03-28 12:41:05,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:04" (3/5) ... 15.75/10.32 [2019-03-28 12:41:05,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fd686bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,734 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.75/10.32 [2019-03-28 12:41:05,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:05" (4/5) ... 15.75/10.32 [2019-03-28 12:41:05,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fd686bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:05, skipping insertion in model container 15.75/10.32 [2019-03-28 12:41:05,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.75/10.32 [2019-03-28 12:41:05,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:05" (5/5) ... 15.75/10.32 [2019-03-28 12:41:05,736 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.75/10.32 [2019-03-28 12:41:05,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.75/10.32 [2019-03-28 12:41:05,758 INFO L374 BuchiCegarLoop]: Interprodecural is true 15.75/10.32 [2019-03-28 12:41:05,758 INFO L375 BuchiCegarLoop]: Hoare is true 15.75/10.32 [2019-03-28 12:41:05,758 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 15.75/10.32 [2019-03-28 12:41:05,758 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 15.75/10.32 [2019-03-28 12:41:05,758 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.75/10.32 [2019-03-28 12:41:05,759 INFO L379 BuchiCegarLoop]: Difference is false 15.75/10.32 [2019-03-28 12:41:05,759 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 15.75/10.32 [2019-03-28 12:41:05,759 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 15.75/10.32 [2019-03-28 12:41:05,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. 15.75/10.32 [2019-03-28 12:41:05,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 15.75/10.32 [2019-03-28 12:41:05,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.75/10.32 [2019-03-28 12:41:05,768 INFO L119 BuchiIsEmpty]: Starting construction of run 15.75/10.32 [2019-03-28 12:41:05,772 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,772 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,773 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 15.75/10.32 [2019-03-28 12:41:05,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. 15.75/10.32 [2019-03-28 12:41:05,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 15.75/10.32 [2019-03-28 12:41:05,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.75/10.32 [2019-03-28 12:41:05,775 INFO L119 BuchiIsEmpty]: Starting construction of run 15.75/10.32 [2019-03-28 12:41:05,775 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,775 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 15.75/10.32 [2019-03-28 12:41:05,780 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [70] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= v_~x~0.offset_1 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= v_~x~0.base_1 0)) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, ~x~0.base=v_~x~0.base_1, ~x~0.offset=v_~x~0.offset_1, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[~x~0.base, ~x~0.offset, #valid, #NULL.offset, #NULL.base] 11#L-1true [103] L-1-->L13: Formula: (and (= v_~x~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_#length_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_~x~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{~x~0.offset=v_~x~0.offset_2, ~x~0.base=v_~x~0.base_2, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_1|, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[~x~0.offset, ~x~0.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, #length, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret6, ULTIMATE.start_main_#t~mem4] 17#L13true [130] L13-->L16-2: Formula: (and (<= 0 v_~x~0.offset_15) (= (store |v_#memory_int_11| v_~x~0.base_21 (store (select |v_#memory_int_11| v_~x~0.base_21) v_~x~0.offset_15 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_10|) (= 1 (select |v_#valid_19| v_~x~0.base_21)) (<= (+ v_~x~0.offset_15 4) (select |v_#length_15| v_~x~0.base_21))) InVars {~x~0.base=v_~x~0.base_21, ~x~0.offset=v_~x~0.offset_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} OutVars{~x~0.base=v_~x~0.base_21, ~x~0.offset=v_~x~0.offset_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 21#L16-2true 15.75/10.32 [2019-03-28 12:41:05,781 INFO L796 eck$LassoCheckResult]: Loop: 21#L16-2true [140] L16-2-->L16: Formula: (and (= 1 (select |v_#valid_32| v_~x~0.base_28)) (< 0 (select (select |v_#memory_int_22| v_~x~0.base_28) v_~x~0.offset_22)) (<= 0 v_~x~0.offset_22) (<= (+ v_~x~0.offset_22 4) (select |v_#length_22| v_~x~0.base_28))) InVars {~x~0.base=v_~x~0.base_28, ~x~0.offset=v_~x~0.offset_22, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x~0.base=v_~x~0.base_28, ~x~0.offset=v_~x~0.offset_22, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 3#L16true [53] L16-->L8-4: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_foo_#res=|v_ULTIMATE.start_foo_#res_3|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_foo_#t~mem0, ULTIMATE.start_foo_#res] 23#L8-4true [133] L8-4-->L8-6: Formula: (and (= |v_ULTIMATE.start_foo_#t~mem0_9| (select (select |v_#memory_int_12| v_~x~0.base_22) v_~x~0.offset_16)) (<= 0 v_~x~0.offset_16) (= 1 (select |v_#valid_24| v_~x~0.base_22)) (= |v_ULTIMATE.start_foo_#t~post1_9| |v_ULTIMATE.start_foo_#t~mem0_9|) (<= (+ v_~x~0.offset_16 4) (select |v_#length_16| v_~x~0.base_22))) InVars {~x~0.base=v_~x~0.base_22, ~x~0.offset=v_~x~0.offset_16, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_9|, ~x~0.base=v_~x~0.base_22, ~x~0.offset=v_~x~0.offset_16, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~mem0] 16#L8-6true [138] L8-6-->L16-2: Formula: (and (<= (+ v_~x~0.offset_20 4) (select |v_#length_20| v_~x~0.base_26)) (= (store |v_#memory_int_19| v_~x~0.base_26 (store (select |v_#memory_int_19| v_~x~0.base_26) v_~x~0.offset_20 (+ |v_ULTIMATE.start_foo_#t~post1_16| (- 1)))) |v_#memory_int_18|) (= 1 (select |v_#valid_30| v_~x~0.base_26)) (<= 0 v_~x~0.offset_20)) InVars {ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_16|, ~x~0.base=v_~x~0.base_26, ~x~0.offset=v_~x~0.offset_20, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_19|, #length=|v_#length_20|} OutVars{ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_15|, ~x~0.base=v_~x~0.base_26, ~x~0.offset=v_~x~0.offset_20, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_13|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~mem0, #memory_int, ULTIMATE.start_main_#t~ret7] 21#L16-2true 15.75/10.32 [2019-03-28 12:41:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.32 [2019-03-28 12:41:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 100384, now seen corresponding path program 1 times 15.75/10.32 [2019-03-28 12:41:05,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.75/10.32 [2019-03-28 12:41:05,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.75/10.32 [2019-03-28 12:41:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.32 [2019-03-28 12:41:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.32 [2019-03-28 12:41:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.32 [2019-03-28 12:41:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash 5149455, now seen corresponding path program 1 times 15.75/10.32 [2019-03-28 12:41:05,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.75/10.32 [2019-03-28 12:41:05,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.75/10.32 [2019-03-28 12:41:05,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.32 [2019-03-28 12:41:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.32 [2019-03-28 12:41:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.32 [2019-03-28 12:41:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1778322514, now seen corresponding path program 1 times 15.75/10.32 [2019-03-28 12:41:05,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.75/10.32 [2019-03-28 12:41:05,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.75/10.32 [2019-03-28 12:41:05,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.75/10.32 [2019-03-28 12:41:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.32 [2019-03-28 12:41:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.32 [2019-03-28 12:41:06,006 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 15.75/10.32 [2019-03-28 12:41:06,066 INFO L216 LassoAnalysis]: Preferences: 15.75/10.32 [2019-03-28 12:41:06,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.75/10.32 [2019-03-28 12:41:06,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.75/10.32 [2019-03-28 12:41:06,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.75/10.32 [2019-03-28 12:41:06,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.75/10.32 [2019-03-28 12:41:06,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.75/10.32 [2019-03-28 12:41:06,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.75/10.32 [2019-03-28 12:41:06,068 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.75/10.32 [2019-03-28 12:41:06,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 15.75/10.32 [2019-03-28 12:41:06,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.75/10.32 [2019-03-28 12:41:06,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.75/10.32 [2019-03-28 12:41:06,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.75/10.32 [2019-03-28 12:41:06,456 INFO L300 LassoAnalysis]: Preprocessing complete. 15.75/10.32 [2019-03-28 12:41:06,462 INFO L497 LassoAnalysis]: Using template 'affine'. 15.75/10.32 [2019-03-28 12:41:06,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.75/10.32 [2019-03-28 12:41:06,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.32 [2019-03-28 12:41:06,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.75/10.32 [2019-03-28 12:41:06,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.32 [2019-03-28 12:41:06,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.75/10.32 [2019-03-28 12:41:06,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.32 [2019-03-28 12:41:06,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.32 [2019-03-28 12:41:06,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.75/10.32 [2019-03-28 12:41:06,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.32 [2019-03-28 12:41:06,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.75/10.32 [2019-03-28 12:41:06,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.32 [2019-03-28 12:41:06,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.32 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.32 Number of strict supporting invariants: 0 15.75/10.32 Number of non-strict supporting invariants: 1 15.75/10.32 Consider only non-deceasing supporting invariants: true 15.75/10.32 Simplify termination arguments: true 15.75/10.32 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.32 [2019-03-28 12:41:06,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.32 [2019-03-28 12:41:06,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.32 [2019-03-28 12:41:06,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.32 [2019-03-28 12:41:06,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.32 [2019-03-28 12:41:06,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.75/10.32 [2019-03-28 12:41:06,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.75/10.32 [2019-03-28 12:41:06,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.33 [2019-03-28 12:41:06,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.33 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.33 Number of strict supporting invariants: 0 15.75/10.33 Number of non-strict supporting invariants: 1 15.75/10.33 Consider only non-deceasing supporting invariants: true 15.75/10.33 Simplify termination arguments: true 15.75/10.33 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.33 [2019-03-28 12:41:06,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.33 [2019-03-28 12:41:06,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.33 [2019-03-28 12:41:06,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.33 [2019-03-28 12:41:06,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.33 [2019-03-28 12:41:06,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.75/10.33 [2019-03-28 12:41:06,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.75/10.33 [2019-03-28 12:41:06,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.75/10.33 [2019-03-28 12:41:06,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.75/10.33 Termination analysis: LINEAR_WITH_GUESSES 15.75/10.33 Number of strict supporting invariants: 0 15.75/10.33 Number of non-strict supporting invariants: 1 15.75/10.33 Consider only non-deceasing supporting invariants: true 15.75/10.33 Simplify termination arguments: true 15.75/10.33 Simplify supporting invariants: trueOverapproximate stem: false 15.75/10.33 [2019-03-28 12:41:06,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.75/10.33 [2019-03-28 12:41:06,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.75/10.33 [2019-03-28 12:41:06,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.75/10.33 [2019-03-28 12:41:06,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.75/10.33 [2019-03-28 12:41:06,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.75/10.33 [2019-03-28 12:41:06,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.75/10.33 [2019-03-28 12:41:06,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.75/10.33 [2019-03-28 12:41:06,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 15.75/10.33 [2019-03-28 12:41:06,555 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 15.75/10.33 [2019-03-28 12:41:06,559 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.75/10.33 [2019-03-28 12:41:06,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 15.75/10.33 [2019-03-28 12:41:06,561 INFO L518 LassoAnalysis]: Proved termination. 15.75/10.33 [2019-03-28 12:41:06,562 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.75/10.33 Ranking function f(v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1) = 1*v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1 15.75/10.33 Supporting invariants [] 15.75/10.33 [2019-03-28 12:41:06,570 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 15.75/10.33 [2019-03-28 12:41:06,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 15.75/10.33 [2019-03-28 12:41:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.75/10.33 [2019-03-28 12:41:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.75/10.33 [2019-03-28 12:41:06,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core 15.75/10.33 [2019-03-28 12:41:06,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.75/10.33 [2019-03-28 12:41:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.75/10.33 [2019-03-28 12:41:06,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core 15.75/10.33 [2019-03-28 12:41:06,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.75/10.33 [2019-03-28 12:41:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.75/10.33 [2019-03-28 12:41:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.75/10.33 [2019-03-28 12:41:06,691 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 15.75/10.33 [2019-03-28 12:41:06,692 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.75/10.33 [2019-03-28 12:41:06,695 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 15.75/10.33 [2019-03-28 12:41:06,696 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states. Second operand 4 states. 15.75/10.33 [2019-03-28 12:41:06,819 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states.. Second operand 4 states. Result 37 states and 72 transitions. Complement of second has 8 states. 15.75/10.33 [2019-03-28 12:41:06,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 15.75/10.33 [2019-03-28 12:41:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 15.75/10.33 [2019-03-28 12:41:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. 15.75/10.33 [2019-03-28 12:41:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 4 letters. 15.75/10.33 [2019-03-28 12:41:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.75/10.33 [2019-03-28 12:41:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 7 letters. Loop has 4 letters. 15.75/10.33 [2019-03-28 12:41:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.75/10.33 [2019-03-28 12:41:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 8 letters. 15.75/10.33 [2019-03-28 12:41:06,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.75/10.33 [2019-03-28 12:41:06,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 72 transitions. 15.75/10.33 [2019-03-28 12:41:06,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.75/10.33 [2019-03-28 12:41:06,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. 15.75/10.33 [2019-03-28 12:41:06,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 15.75/10.33 [2019-03-28 12:41:06,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 15.75/10.33 [2019-03-28 12:41:06,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 15.75/10.33 [2019-03-28 12:41:06,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.75/10.33 [2019-03-28 12:41:06,838 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.75/10.33 [2019-03-28 12:41:06,838 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.75/10.33 [2019-03-28 12:41:06,838 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.75/10.33 [2019-03-28 12:41:06,838 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 15.75/10.33 [2019-03-28 12:41:06,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 15.75/10.33 [2019-03-28 12:41:06,839 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.75/10.33 [2019-03-28 12:41:06,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 15.75/10.33 [2019-03-28 12:41:06,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:06 BasicIcfg 15.75/10.33 [2019-03-28 12:41:06,845 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 15.75/10.33 [2019-03-28 12:41:06,845 INFO L168 Benchmark]: Toolchain (without parser) took 2609.30 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.7 MB in the beginning and 409.0 MB in the end (delta: 156.7 MB). Peak memory consumption was 181.9 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,846 INFO L168 Benchmark]: CDTParser took 0.17 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. 15.75/10.33 [2019-03-28 12:41:06,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.44 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.7 MB in the beginning and 642.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 32.4 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.81 ms. Allocated memory is still 674.8 MB. Free memory was 642.5 MB in the beginning and 638.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,848 INFO L168 Benchmark]: Boogie Preprocessor took 25.05 ms. Allocated memory is still 674.8 MB. Free memory was 638.6 MB in the beginning and 637.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,849 INFO L168 Benchmark]: RCFGBuilder took 320.03 ms. Allocated memory is still 674.8 MB. Free memory was 637.5 MB in the beginning and 617.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,850 INFO L168 Benchmark]: BlockEncodingV2 took 148.47 ms. Allocated memory is still 674.8 MB. Free memory was 617.4 MB in the beginning and 608.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,850 INFO L168 Benchmark]: TraceAbstraction took 638.20 ms. Allocated memory is still 674.8 MB. Free memory was 607.7 MB in the beginning and 554.6 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,851 INFO L168 Benchmark]: BuchiAutomizer took 1117.00 ms. Allocated memory is still 674.8 MB. Free memory was 554.6 MB in the beginning and 409.0 MB in the end (delta: 145.6 MB). Peak memory consumption was 145.6 MB. Max. memory is 50.3 GB. 15.75/10.33 [2019-03-28 12:41:06,855 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 15.75/10.33 --- Results --- 15.75/10.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 15.75/10.33 - StatisticsResult: Initial Icfg 15.75/10.33 33 locations, 35 edges 15.75/10.33 - StatisticsResult: Encoded RCFG 15.75/10.33 21 locations, 36 edges 15.75/10.33 * Results from de.uni_freiburg.informatik.ultimate.core: 15.75/10.33 - StatisticsResult: Toolchain Benchmarks 15.75/10.33 Benchmark results are: 15.75/10.33 * CDTParser took 0.17 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. 15.75/10.33 * CACSL2BoogieTranslator took 311.44 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.7 MB in the beginning and 642.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 32.4 MB. Max. memory is 50.3 GB. 15.75/10.33 * Boogie Procedure Inliner took 43.81 ms. Allocated memory is still 674.8 MB. Free memory was 642.5 MB in the beginning and 638.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 15.75/10.33 * Boogie Preprocessor took 25.05 ms. Allocated memory is still 674.8 MB. Free memory was 638.6 MB in the beginning and 637.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 15.75/10.33 * RCFGBuilder took 320.03 ms. Allocated memory is still 674.8 MB. Free memory was 637.5 MB in the beginning and 617.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 15.75/10.33 * BlockEncodingV2 took 148.47 ms. Allocated memory is still 674.8 MB. Free memory was 617.4 MB in the beginning and 608.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 15.75/10.33 * TraceAbstraction took 638.20 ms. Allocated memory is still 674.8 MB. Free memory was 607.7 MB in the beginning and 554.6 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 50.3 GB. 15.75/10.33 * BuchiAutomizer took 1117.00 ms. Allocated memory is still 674.8 MB. Free memory was 554.6 MB in the beginning and 409.0 MB in the end (delta: 145.6 MB). Peak memory consumption was 145.6 MB. Max. memory is 50.3 GB. 15.75/10.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 15.75/10.33 - GenericResult: Unfinished Backtranslation 15.75/10.33 unknown boogie variable #length 15.75/10.33 - GenericResult: Unfinished Backtranslation 15.75/10.33 unknown boogie variable #length 15.75/10.33 - GenericResult: Unfinished Backtranslation 15.75/10.33 unknown boogie variable #memory_int 15.75/10.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 15]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 15]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - PositiveResult [Line: 8]: pointer dereference always succeeds 15.75/10.33 For all program executions holds that pointer dereference always succeeds at this location 15.75/10.33 - AllSpecificationsHoldResult: All specifications hold 15.75/10.33 12 specifications checked. All of them hold 15.75/10.33 - InvariantResult [Line: 15]: Loop Invariant 15.75/10.33 [2019-03-28 12:41:06,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.75/10.33 [2019-03-28 12:41:06,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.75/10.33 Derived loop invariant: (\valid[x] == 1 && x == 0) && unknown-#length-unknown[x] == 4 15.75/10.33 - StatisticsResult: Ultimate Automizer benchmark data 15.75/10.33 CFG has 1 procedures, 21 locations, 12 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 45 SDslu, 0 SDs, 0 SdLazy, 50 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 15.75/10.33 - StatisticsResult: Constructed decomposition of program 15.75/10.33 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. 15.75/10.33 - StatisticsResult: Timing statistics 15.75/10.33 BüchiAutomizer plugin needed 1.0s 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: 9 SDtfs, 91 SDslu, 3 SDs, 0 SdLazy, 106 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp88 ukn69 mio100 lsp41 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 15.75/10.33 - TerminationAnalysisResult: Termination proven 15.75/10.33 Buchi Automizer proved that your program is terminating 15.75/10.33 RESULT: Ultimate proved your program to be correct! 15.75/10.33 !SESSION 2019-03-28 12:40:59.275 ----------------------------------------------- 15.75/10.33 eclipse.buildId=unknown 15.75/10.33 java.version=1.8.0_181 15.75/10.33 java.vendor=Oracle Corporation 15.75/10.33 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 15.75/10.33 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 15.75/10.33 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 15.75/10.33 15.75/10.33 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:07.091 15.75/10.33 !MESSAGE The workspace will exit with unsaved changes in this session. 15.75/10.33 Received shutdown request... 15.75/10.33 Ultimate: 15.75/10.33 GTK+ Version Check 15.75/10.33 EOF