19.20/8.70 YES 19.20/8.70 19.20/8.70 Ultimate: Cannot open display: 19.20/8.70 This is Ultimate 0.1.24-8dc7c08-m 19.20/8.70 [2019-03-28 12:44:45,334 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.20/8.70 [2019-03-28 12:44:45,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.20/8.70 [2019-03-28 12:44:45,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,348 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.20/8.70 [2019-03-28 12:44:45,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.20/8.70 [2019-03-28 12:44:45,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.20/8.70 [2019-03-28 12:44:45,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.20/8.70 [2019-03-28 12:44:45,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.20/8.70 [2019-03-28 12:44:45,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.20/8.70 [2019-03-28 12:44:45,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.20/8.70 [2019-03-28 12:44:45,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.20/8.70 [2019-03-28 12:44:45,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.20/8.70 [2019-03-28 12:44:45,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.20/8.70 [2019-03-28 12:44:45,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.20/8.70 [2019-03-28 12:44:45,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.20/8.70 [2019-03-28 12:44:45,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.20/8.70 [2019-03-28 12:44:45,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.20/8.70 [2019-03-28 12:44:45,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.20/8.70 [2019-03-28 12:44:45,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.20/8.70 [2019-03-28 12:44:45,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.20/8.70 [2019-03-28 12:44:45,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.20/8.70 [2019-03-28 12:44:45,369 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.20/8.70 [2019-03-28 12:44:45,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.20/8.70 [2019-03-28 12:44:45,371 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.20/8.70 [2019-03-28 12:44:45,372 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.20/8.70 [2019-03-28 12:44:45,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.20/8.70 [2019-03-28 12:44:45,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.20/8.70 [2019-03-28 12:44:45,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.20/8.70 [2019-03-28 12:44:45,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,375 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.20/8.70 [2019-03-28 12:44:45,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.20/8.70 [2019-03-28 12:44:45,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.20/8.70 [2019-03-28 12:44:45,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.20/8.70 [2019-03-28 12:44:45,377 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.20/8.70 [2019-03-28 12:44:45,391 INFO L110 SettingsManager]: Loading preferences was successful 19.20/8.70 [2019-03-28 12:44:45,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.20/8.70 [2019-03-28 12:44:45,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.20/8.70 [2019-03-28 12:44:45,393 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.20/8.70 [2019-03-28 12:44:45,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.20/8.70 [2019-03-28 12:44:45,393 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.20/8.70 [2019-03-28 12:44:45,393 INFO L133 SettingsManager]: * Use SBE=true 19.20/8.70 [2019-03-28 12:44:45,394 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.20/8.70 [2019-03-28 12:44:45,394 INFO L133 SettingsManager]: * Use old map elimination=false 19.20/8.70 [2019-03-28 12:44:45,394 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.20/8.70 [2019-03-28 12:44:45,394 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.20/8.70 [2019-03-28 12:44:45,394 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.20/8.70 [2019-03-28 12:44:45,394 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.20/8.70 [2019-03-28 12:44:45,395 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.20/8.70 [2019-03-28 12:44:45,395 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.20/8.70 [2019-03-28 12:44:45,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.20/8.70 [2019-03-28 12:44:45,395 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.20/8.70 [2019-03-28 12:44:45,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.20/8.70 [2019-03-28 12:44:45,395 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.20/8.70 [2019-03-28 12:44:45,396 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.20/8.70 [2019-03-28 12:44:45,396 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.20/8.70 [2019-03-28 12:44:45,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.20/8.70 [2019-03-28 12:44:45,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.20/8.70 [2019-03-28 12:44:45,396 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.20/8.70 [2019-03-28 12:44:45,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.20/8.70 [2019-03-28 12:44:45,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.20/8.70 [2019-03-28 12:44:45,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.20/8.70 [2019-03-28 12:44:45,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.20/8.70 [2019-03-28 12:44:45,397 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.20/8.70 [2019-03-28 12:44:45,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.20/8.70 [2019-03-28 12:44:45,436 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.20/8.70 [2019-03-28 12:44:45,439 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.20/8.70 [2019-03-28 12:44:45,440 INFO L271 PluginConnector]: Initializing CDTParser... 19.20/8.70 [2019-03-28 12:44:45,441 INFO L276 PluginConnector]: CDTParser initialized 19.20/8.70 [2019-03-28 12:44:45,442 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.20/8.70 [2019-03-28 12:44:45,503 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/74cc142683ba46969af42d8ede6089d2/FLAG93ee4eadb 19.20/8.70 [2019-03-28 12:44:45,843 INFO L307 CDTParser]: Found 1 translation units. 19.20/8.70 [2019-03-28 12:44:45,844 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.20/8.70 [2019-03-28 12:44:45,844 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 19.20/8.70 [2019-03-28 12:44:45,850 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/74cc142683ba46969af42d8ede6089d2/FLAG93ee4eadb 19.20/8.70 [2019-03-28 12:44:46,258 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/74cc142683ba46969af42d8ede6089d2 19.20/8.70 [2019-03-28 12:44:46,270 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.20/8.70 [2019-03-28 12:44:46,271 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.20/8.70 [2019-03-28 12:44:46,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.20/8.70 [2019-03-28 12:44:46,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.20/8.70 [2019-03-28 12:44:46,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.20/8.70 [2019-03-28 12:44:46,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d764181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46, skipping insertion in model container 19.20/8.70 [2019-03-28 12:44:46,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.20/8.70 [2019-03-28 12:44:46,305 INFO L176 MainTranslator]: Built tables and reachable declarations 19.20/8.70 [2019-03-28 12:44:46,465 INFO L206 PostProcessor]: Analyzing one entry point: main 19.20/8.70 [2019-03-28 12:44:46,479 INFO L191 MainTranslator]: Completed pre-run 19.20/8.70 [2019-03-28 12:44:46,495 INFO L206 PostProcessor]: Analyzing one entry point: main 19.20/8.70 [2019-03-28 12:44:46,574 INFO L195 MainTranslator]: Completed translation 19.20/8.70 [2019-03-28 12:44:46,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46 WrapperNode 19.20/8.70 [2019-03-28 12:44:46,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.20/8.70 [2019-03-28 12:44:46,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.20/8.70 [2019-03-28 12:44:46,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.20/8.70 [2019-03-28 12:44:46,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.20/8.70 [2019-03-28 12:44:46,586 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:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,595 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:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.20/8.70 [2019-03-28 12:44:46,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.20/8.70 [2019-03-28 12:44:46,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.20/8.70 [2019-03-28 12:44:46,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.20/8.70 [2019-03-28 12:44:46,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.20/8.70 [2019-03-28 12:44:46,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.20/8.70 [2019-03-28 12:44:46,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.20/8.70 [2019-03-28 12:44:46,642 INFO L276 PluginConnector]: RCFGBuilder initialized 19.20/8.70 [2019-03-28 12:44:46,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (1/1) ... 19.20/8.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.20/8.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.20/8.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.20/8.70 [2019-03-28 12:44:46,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 19.20/8.70 [2019-03-28 12:44:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.20/8.70 [2019-03-28 12:44:46,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.20/8.70 [2019-03-28 12:44:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 19.20/8.70 [2019-03-28 12:44:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 19.20/8.70 [2019-03-28 12:44:46,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 19.20/8.70 [2019-03-28 12:44:46,951 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.20/8.70 [2019-03-28 12:44:46,951 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 19.20/8.70 [2019-03-28 12:44:46,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:46 BoogieIcfgContainer 19.20/8.70 [2019-03-28 12:44:46,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.20/8.70 [2019-03-28 12:44:46,954 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.20/8.70 [2019-03-28 12:44:46,954 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.20/8.70 [2019-03-28 12:44:46,956 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.20/8.70 [2019-03-28 12:44:46,957 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:46" (1/1) ... 19.20/8.70 [2019-03-28 12:44:46,973 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 31 edges 19.20/8.70 [2019-03-28 12:44:46,974 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.20/8.70 [2019-03-28 12:44:46,975 INFO L263 BlockEncoder]: Using Maximize final states 19.20/8.70 [2019-03-28 12:44:46,976 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.20/8.70 [2019-03-28 12:44:46,976 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.20/8.70 [2019-03-28 12:44:46,978 INFO L296 BlockEncoder]: Using Remove sink states 19.20/8.70 [2019-03-28 12:44:46,979 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.20/8.70 [2019-03-28 12:44:46,979 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.20/8.70 [2019-03-28 12:44:47,001 INFO L185 BlockEncoder]: Using Use SBE 19.20/8.70 [2019-03-28 12:44:47,033 INFO L200 BlockEncoder]: SBE split 15 edges 19.20/8.70 [2019-03-28 12:44:47,038 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 19.20/8.71 [2019-03-28 12:44:47,040 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.20/8.71 [2019-03-28 12:44:47,074 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 19.20/8.71 [2019-03-28 12:44:47,077 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 19.20/8.71 [2019-03-28 12:44:47,079 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.20/8.71 [2019-03-28 12:44:47,079 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.20/8.71 [2019-03-28 12:44:47,084 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 19.20/8.71 [2019-03-28 12:44:47,085 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.20/8.71 [2019-03-28 12:44:47,085 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.20/8.71 [2019-03-28 12:44:47,086 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.20/8.71 [2019-03-28 12:44:47,086 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.20/8.71 [2019-03-28 12:44:47,086 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.20/8.71 [2019-03-28 12:44:47,087 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 40 edges 19.20/8.71 [2019-03-28 12:44:47,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:47 BasicIcfg 19.20/8.71 [2019-03-28 12:44:47,088 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.20/8.71 [2019-03-28 12:44:47,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.20/8.71 [2019-03-28 12:44:47,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.20/8.71 [2019-03-28 12:44:47,092 INFO L276 PluginConnector]: TraceAbstraction initialized 19.20/8.71 [2019-03-28 12:44:47,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:46" (1/4) ... 19.20/8.71 [2019-03-28 12:44:47,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32142da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (2/4) ... 19.20/8.71 [2019-03-28 12:44:47,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32142da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:46" (3/4) ... 19.20/8.71 [2019-03-28 12:44:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32142da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:47" (4/4) ... 19.20/8.71 [2019-03-28 12:44:47,096 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.20/8.71 [2019-03-28 12:44:47,106 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.20/8.71 [2019-03-28 12:44:47,114 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 19.20/8.71 [2019-03-28 12:44:47,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 19.20/8.71 [2019-03-28 12:44:47,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.20/8.71 [2019-03-28 12:44:47,161 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.20/8.71 [2019-03-28 12:44:47,161 INFO L383 AbstractCegarLoop]: Hoare is true 19.20/8.71 [2019-03-28 12:44:47,162 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.20/8.71 [2019-03-28 12:44:47,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.20/8.71 [2019-03-28 12:44:47,162 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.20/8.71 [2019-03-28 12:44:47,162 INFO L387 AbstractCegarLoop]: Difference is false 19.20/8.71 [2019-03-28 12:44:47,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.20/8.71 [2019-03-28 12:44:47,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.20/8.71 [2019-03-28 12:44:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. 19.20/8.71 [2019-03-28 12:44:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.20/8.71 [2019-03-28 12:44:47,183 INFO L394 BasicCegarLoop]: Found error trace 19.20/8.71 [2019-03-28 12:44:47,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.20/8.71 [2019-03-28 12:44:47,185 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 19.20/8.71 [2019-03-28 12:44:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 100877, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:47,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:47,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.20/8.71 [2019-03-28 12:44:47,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.20/8.71 [2019-03-28 12:44:47,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.20/8.71 [2019-03-28 12:44:47,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.20/8.71 [2019-03-28 12:44:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.20/8.71 [2019-03-28 12:44:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.20/8.71 [2019-03-28 12:44:47,387 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. 19.20/8.71 [2019-03-28 12:44:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.20/8.71 [2019-03-28 12:44:47,501 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. 19.20/8.71 [2019-03-28 12:44:47,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.20/8.71 [2019-03-28 12:44:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.20/8.71 [2019-03-28 12:44:47,516 INFO L225 Difference]: With dead ends: 23 19.20/8.71 [2019-03-28 12:44:47,516 INFO L226 Difference]: Without dead ends: 19 19.20/8.71 [2019-03-28 12:44:47,520 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 19.20/8.71 [2019-03-28 12:44:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 19.20/8.71 [2019-03-28 12:44:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 19.20/8.71 [2019-03-28 12:44:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 19.20/8.71 [2019-03-28 12:44:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. 19.20/8.71 [2019-03-28 12:44:47,558 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 3 19.20/8.71 [2019-03-28 12:44:47,559 INFO L84 Accepts]: Finished accepts. word is rejected. 19.20/8.71 [2019-03-28 12:44:47,559 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. 19.20/8.71 [2019-03-28 12:44:47,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. 19.20/8.71 [2019-03-28 12:44:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.20/8.71 [2019-03-28 12:44:47,560 INFO L394 BasicCegarLoop]: Found error trace 19.20/8.71 [2019-03-28 12:44:47,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.20/8.71 [2019-03-28 12:44:47,560 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 19.20/8.71 [2019-03-28 12:44:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:47,561 INFO L82 PathProgramCache]: Analyzing trace with hash 100874, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:47,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.20/8.71 [2019-03-28 12:44:47,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.20/8.71 [2019-03-28 12:44:47,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.20/8.71 [2019-03-28 12:44:47,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.20/8.71 [2019-03-28 12:44:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.20/8.71 [2019-03-28 12:44:47,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.20/8.71 [2019-03-28 12:44:47,590 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 3 states. 19.20/8.71 [2019-03-28 12:44:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.20/8.71 [2019-03-28 12:44:47,653 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. 19.20/8.71 [2019-03-28 12:44:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.20/8.71 [2019-03-28 12:44:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.20/8.71 [2019-03-28 12:44:47,655 INFO L225 Difference]: With dead ends: 19 19.20/8.71 [2019-03-28 12:44:47,655 INFO L226 Difference]: Without dead ends: 15 19.20/8.71 [2019-03-28 12:44:47,656 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 19.20/8.71 [2019-03-28 12:44:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 19.20/8.71 [2019-03-28 12:44:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. 19.20/8.71 [2019-03-28 12:44:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 19.20/8.71 [2019-03-28 12:44:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. 19.20/8.71 [2019-03-28 12:44:47,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 3 19.20/8.71 [2019-03-28 12:44:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. 19.20/8.71 [2019-03-28 12:44:47,660 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. 19.20/8.71 [2019-03-28 12:44:47,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. 19.20/8.71 [2019-03-28 12:44:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.20/8.71 [2019-03-28 12:44:47,661 INFO L394 BasicCegarLoop]: Found error trace 19.20/8.71 [2019-03-28 12:44:47,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.20/8.71 [2019-03-28 12:44:47,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 19.20/8.71 [2019-03-28 12:44:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash 3126137, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:47,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.20/8.71 [2019-03-28 12:44:47,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.20/8.71 [2019-03-28 12:44:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.20/8.71 [2019-03-28 12:44:47,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.20/8.71 [2019-03-28 12:44:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.20/8.71 [2019-03-28 12:44:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.20/8.71 [2019-03-28 12:44:47,720 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 4 states. 19.20/8.71 [2019-03-28 12:44:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.20/8.71 [2019-03-28 12:44:47,772 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. 19.20/8.71 [2019-03-28 12:44:47,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 19.20/8.71 [2019-03-28 12:44:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.20/8.71 [2019-03-28 12:44:47,773 INFO L225 Difference]: With dead ends: 15 19.20/8.71 [2019-03-28 12:44:47,773 INFO L226 Difference]: Without dead ends: 12 19.20/8.71 [2019-03-28 12:44:47,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.20/8.71 [2019-03-28 12:44:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 19.20/8.71 [2019-03-28 12:44:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 19.20/8.71 [2019-03-28 12:44:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 19.20/8.71 [2019-03-28 12:44:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. 19.20/8.71 [2019-03-28 12:44:47,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 4 19.20/8.71 [2019-03-28 12:44:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. 19.20/8.71 [2019-03-28 12:44:47,777 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. 19.20/8.71 [2019-03-28 12:44:47,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.20/8.71 [2019-03-28 12:44:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. 19.20/8.71 [2019-03-28 12:44:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.20/8.71 [2019-03-28 12:44:47,778 INFO L394 BasicCegarLoop]: Found error trace 19.20/8.71 [2019-03-28 12:44:47,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.20/8.71 [2019-03-28 12:44:47,778 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 19.20/8.71 [2019-03-28 12:44:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash 3126139, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:47,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:47,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.20/8.71 [2019-03-28 12:44:47,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.20/8.71 [2019-03-28 12:44:47,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.20/8.71 [2019-03-28 12:44:47,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.20/8.71 [2019-03-28 12:44:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.20/8.71 [2019-03-28 12:44:47,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.20/8.71 [2019-03-28 12:44:47,804 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 3 states. 19.20/8.71 [2019-03-28 12:44:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.20/8.71 [2019-03-28 12:44:47,826 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. 19.20/8.71 [2019-03-28 12:44:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 19.20/8.71 [2019-03-28 12:44:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.20/8.71 [2019-03-28 12:44:47,828 INFO L225 Difference]: With dead ends: 15 19.20/8.71 [2019-03-28 12:44:47,828 INFO L226 Difference]: Without dead ends: 12 19.20/8.71 [2019-03-28 12:44:47,828 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 19.20/8.71 [2019-03-28 12:44:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 19.20/8.71 [2019-03-28 12:44:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 19.20/8.71 [2019-03-28 12:44:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 19.20/8.71 [2019-03-28 12:44:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. 19.20/8.71 [2019-03-28 12:44:47,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 4 19.20/8.71 [2019-03-28 12:44:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. 19.20/8.71 [2019-03-28 12:44:47,831 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. 19.20/8.71 [2019-03-28 12:44:47,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. 19.20/8.71 [2019-03-28 12:44:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.20/8.71 [2019-03-28 12:44:47,832 INFO L394 BasicCegarLoop]: Found error trace 19.20/8.71 [2019-03-28 12:44:47,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.20/8.71 [2019-03-28 12:44:47,832 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 19.20/8.71 [2019-03-28 12:44:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash 3126140, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:47,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.20/8.71 [2019-03-28 12:44:47,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.20/8.71 [2019-03-28 12:44:47,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.20/8.71 [2019-03-28 12:44:47,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.20/8.71 [2019-03-28 12:44:47,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.20/8.71 [2019-03-28 12:44:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.20/8.71 [2019-03-28 12:44:47,870 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. 19.20/8.71 [2019-03-28 12:44:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.20/8.71 [2019-03-28 12:44:47,906 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. 19.20/8.71 [2019-03-28 12:44:47,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 19.20/8.71 [2019-03-28 12:44:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.20/8.71 [2019-03-28 12:44:47,907 INFO L225 Difference]: With dead ends: 12 19.20/8.71 [2019-03-28 12:44:47,907 INFO L226 Difference]: Without dead ends: 0 19.20/8.71 [2019-03-28 12:44:47,908 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 19.20/8.71 [2019-03-28 12:44:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 19.20/8.71 [2019-03-28 12:44:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 19.20/8.71 [2019-03-28 12:44:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 19.20/8.71 [2019-03-28 12:44:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:47,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 19.20/8.71 [2019-03-28 12:44:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. 19.20/8.71 [2019-03-28 12:44:47,909 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:47,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.20/8.71 [2019-03-28 12:44:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:47,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.20/8.71 [2019-03-28 12:44:47,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,946 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,946 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,946 INFO L444 ceAbstractionStarter]: At program point L7-2(lines 6 10) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) 19.20/8.71 [2019-03-28 12:44:47,946 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,947 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,947 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,947 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,947 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. 19.20/8.71 [2019-03-28 12:44:47,947 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 19.20/8.71 [2019-03-28 12:44:47,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:47,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:47,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:47,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:47,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:47 BasicIcfg 19.20/8.71 [2019-03-28 12:44:47,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.20/8.71 [2019-03-28 12:44:47,968 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.20/8.71 [2019-03-28 12:44:47,968 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.20/8.71 [2019-03-28 12:44:47,972 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.20/8.71 [2019-03-28 12:44:47,972 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.20/8.71 [2019-03-28 12:44:47,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:46" (1/5) ... 19.20/8.71 [2019-03-28 12:44:47,973 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41470e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,973 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.20/8.71 [2019-03-28 12:44:47,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:46" (2/5) ... 19.20/8.71 [2019-03-28 12:44:47,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41470e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.20/8.71 [2019-03-28 12:44:47,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:46" (3/5) ... 19.20/8.71 [2019-03-28 12:44:47,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41470e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.20/8.71 [2019-03-28 12:44:47,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:47" (4/5) ... 19.20/8.71 [2019-03-28 12:44:47,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41470e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:47, skipping insertion in model container 19.20/8.71 [2019-03-28 12:44:47,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.20/8.71 [2019-03-28 12:44:47,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:47" (5/5) ... 19.20/8.71 [2019-03-28 12:44:47,977 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.20/8.71 [2019-03-28 12:44:48,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.20/8.71 [2019-03-28 12:44:48,000 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.20/8.71 [2019-03-28 12:44:48,000 INFO L375 BuchiCegarLoop]: Hoare is true 19.20/8.71 [2019-03-28 12:44:48,000 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.20/8.71 [2019-03-28 12:44:48,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.20/8.71 [2019-03-28 12:44:48,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.20/8.71 [2019-03-28 12:44:48,001 INFO L379 BuchiCegarLoop]: Difference is false 19.20/8.71 [2019-03-28 12:44:48,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.20/8.71 [2019-03-28 12:44:48,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.20/8.71 [2019-03-28 12:44:48,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. 19.20/8.71 [2019-03-28 12:44:48,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.20/8.71 [2019-03-28 12:44:48,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.20/8.71 [2019-03-28 12:44:48,010 INFO L119 BuchiIsEmpty]: Starting construction of run 19.20/8.71 [2019-03-28 12:44:48,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.20/8.71 [2019-03-28 12:44:48,015 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.20/8.71 [2019-03-28 12:44:48,015 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.20/8.71 [2019-03-28 12:44:48,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. 19.20/8.71 [2019-03-28 12:44:48,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.20/8.71 [2019-03-28 12:44:48,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.20/8.71 [2019-03-28 12:44:48,017 INFO L119 BuchiIsEmpty]: Starting construction of run 19.20/8.71 [2019-03-28 12:44:48,017 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.20/8.71 [2019-03-28 12:44:48,017 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.20/8.71 [2019-03-28 12:44:48,023 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue [71] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 17#L-1true [92] L-1-->L6: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 5#L6true [59] L6-->L7-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~y~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 4#L7-2true 19.20/8.71 [2019-03-28 12:44:48,023 INFO L796 eck$LassoCheckResult]: Loop: 4#L7-2true [126] L7-2-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11))) InVars {#valid=|v_#valid_31|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{#valid=|v_#valid_31|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 12#L8true [68] L8-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9#L8-1true [65] L8-1-->L8-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= (select |v_#valid_12| v_ULTIMATE.start_main_~y~0.base_7) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 6#L8-2true [124] L8-2-->L9: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_13)) (= |v_#memory_int_11| (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem3_6| (* (- 1) |v_ULTIMATE.start_main_#t~mem4_6|))))) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_18|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_18|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 15#L9true [52] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 13#L9-1true [125] L9-1-->L7-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_12 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_16)) (= (select |v_#valid_30| v_ULTIMATE.start_main_~y~0.base_16) 1) (= |v_#memory_int_13| (store |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_16) v_ULTIMATE.start_main_~y~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem5_6| 1)))) (<= 0 v_ULTIMATE.start_main_~y~0.offset_12)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_19|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_19|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5] 4#L7-2true 19.20/8.71 [2019-03-28 12:44:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash 100933, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:48,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:48,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:48,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 264666155, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:48,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:48,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1948271471, now seen corresponding path program 1 times 19.20/8.71 [2019-03-28 12:44:48,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.20/8.71 [2019-03-28 12:44:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.20/8.71 [2019-03-28 12:44:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.20/8.71 [2019-03-28 12:44:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:48,367 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 19.20/8.71 [2019-03-28 12:44:48,456 INFO L216 LassoAnalysis]: Preferences: 19.20/8.71 [2019-03-28 12:44:48,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.20/8.71 [2019-03-28 12:44:48,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.20/8.71 [2019-03-28 12:44:48,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.20/8.71 [2019-03-28 12:44:48,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.20/8.71 [2019-03-28 12:44:48,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.20/8.71 [2019-03-28 12:44:48,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.20/8.71 [2019-03-28 12:44:48,458 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.20/8.71 [2019-03-28 12:44:48,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 19.20/8.71 [2019-03-28 12:44:48,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.20/8.71 [2019-03-28 12:44:48,459 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.20/8.71 [2019-03-28 12:44:48,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,658 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 19.20/8.71 [2019-03-28 12:44:48,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:48,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.20/8.71 [2019-03-28 12:44:49,033 INFO L300 LassoAnalysis]: Preprocessing complete. 19.20/8.71 [2019-03-28 12:44:49,039 INFO L497 LassoAnalysis]: Using template 'affine'. 19.20/8.71 [2019-03-28 12:44:49,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.20/8.71 Termination analysis: LINEAR_WITH_GUESSES 19.20/8.71 Number of strict supporting invariants: 0 19.20/8.71 Number of non-strict supporting invariants: 1 19.20/8.71 Consider only non-deceasing supporting invariants: true 19.20/8.71 Simplify termination arguments: true 19.20/8.71 Simplify supporting invariants: trueOverapproximate stem: false 19.20/8.71 [2019-03-28 12:44:49,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.20/8.71 [2019-03-28 12:44:49,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.20/8.71 [2019-03-28 12:44:49,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.20/8.71 [2019-03-28 12:44:49,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.20/8.71 [2019-03-28 12:44:49,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.20/8.71 [2019-03-28 12:44:49,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.20/8.71 [2019-03-28 12:44:49,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.20/8.71 [2019-03-28 12:44:49,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.20/8.71 [2019-03-28 12:44:49,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.20/8.71 Termination analysis: LINEAR_WITH_GUESSES 19.20/8.71 Number of strict supporting invariants: 0 19.20/8.71 Number of non-strict supporting invariants: 1 19.20/8.71 Consider only non-deceasing supporting invariants: true 19.20/8.71 Simplify termination arguments: true 19.20/8.71 Simplify supporting invariants: trueOverapproximate stem: false 19.20/8.71 [2019-03-28 12:44:49,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.20/8.71 [2019-03-28 12:44:49,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.20/8.71 [2019-03-28 12:44:49,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.20/8.71 [2019-03-28 12:44:49,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.20/8.71 [2019-03-28 12:44:49,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.20/8.71 [2019-03-28 12:44:49,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.20/8.71 [2019-03-28 12:44:49,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.20/8.71 [2019-03-28 12:44:49,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.20/8.71 Termination analysis: LINEAR_WITH_GUESSES 19.20/8.71 Number of strict supporting invariants: 0 19.20/8.71 Number of non-strict supporting invariants: 1 19.20/8.71 Consider only non-deceasing supporting invariants: true 19.20/8.71 Simplify termination arguments: true 19.20/8.71 Simplify supporting invariants: trueOverapproximate stem: false 19.20/8.71 [2019-03-28 12:44:49,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.20/8.71 [2019-03-28 12:44:49,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.20/8.71 [2019-03-28 12:44:49,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.20/8.71 [2019-03-28 12:44:49,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.20/8.71 [2019-03-28 12:44:49,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.20/8.71 [2019-03-28 12:44:49,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.20/8.71 [2019-03-28 12:44:49,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.20/8.71 [2019-03-28 12:44:49,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.20/8.71 Termination analysis: LINEAR_WITH_GUESSES 19.20/8.71 Number of strict supporting invariants: 0 19.20/8.71 Number of non-strict supporting invariants: 1 19.20/8.71 Consider only non-deceasing supporting invariants: true 19.20/8.71 Simplify termination arguments: true 19.20/8.71 Simplify supporting invariants: trueOverapproximate stem: false 19.20/8.71 [2019-03-28 12:44:49,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.20/8.71 [2019-03-28 12:44:49,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.20/8.71 [2019-03-28 12:44:49,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.20/8.71 [2019-03-28 12:44:49,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.20/8.71 [2019-03-28 12:44:49,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.20/8.71 [2019-03-28 12:44:49,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.20/8.71 [2019-03-28 12:44:49,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.20/8.71 [2019-03-28 12:44:49,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.20/8.71 Termination analysis: LINEAR_WITH_GUESSES 19.20/8.71 Number of strict supporting invariants: 0 19.20/8.71 Number of non-strict supporting invariants: 1 19.20/8.71 Consider only non-deceasing supporting invariants: true 19.20/8.71 Simplify termination arguments: true 19.20/8.71 Simplify supporting invariants: trueOverapproximate stem: false 19.20/8.71 [2019-03-28 12:44:49,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.20/8.71 [2019-03-28 12:44:49,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.20/8.71 [2019-03-28 12:44:49,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.20/8.71 [2019-03-28 12:44:49,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.20/8.71 [2019-03-28 12:44:49,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.20/8.71 [2019-03-28 12:44:49,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.20/8.71 [2019-03-28 12:44:49,159 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.20/8.71 [2019-03-28 12:44:49,182 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 19.20/8.71 [2019-03-28 12:44:49,183 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. 19.20/8.71 [2019-03-28 12:44:49,185 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.20/8.71 [2019-03-28 12:44:49,187 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 19.20/8.71 [2019-03-28 12:44:49,187 INFO L518 LassoAnalysis]: Proved termination. 19.20/8.71 [2019-03-28 12:44:49,188 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.20/8.71 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 19.20/8.71 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 - 1 >= 0] 19.20/8.71 [2019-03-28 12:44:49,223 INFO L297 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed 19.20/8.71 [2019-03-28 12:44:49,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 19.20/8.71 [2019-03-28 12:44:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.20/8.71 [2019-03-28 12:44:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:49,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core 19.20/8.71 [2019-03-28 12:44:49,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.20/8.71 [2019-03-28 12:44:49,317 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 19.20/8.71 [2019-03-28 12:44:49,318 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.20/8.71 [2019-03-28 12:44:49,329 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 19.20/8.71 [2019-03-28 12:44:49,329 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 19.20/8.71 [2019-03-28 12:44:49,329 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 19.20/8.71 [2019-03-28 12:44:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:49,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core 19.20/8.71 [2019-03-28 12:44:49,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.20/8.71 [2019-03-28 12:44:49,458 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 19.20/8.71 [2019-03-28 12:44:49,460 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.20/8.71 [2019-03-28 12:44:49,474 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 19.20/8.71 [2019-03-28 12:44:49,476 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 19.20/8.71 [2019-03-28 12:44:49,476 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:28 19.20/8.71 [2019-03-28 12:44:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.20/8.71 [2019-03-28 12:44:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:49,648 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.20/8.71 [2019-03-28 12:44:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:49,656 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.20/8.71 [2019-03-28 12:44:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.20/8.71 [2019-03-28 12:44:49,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core 19.20/8.71 [2019-03-28 12:44:49,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.20/8.71 [2019-03-28 12:44:49,700 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 19.20/8.71 [2019-03-28 12:44:49,701 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.20/8.71 [2019-03-28 12:44:49,709 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 19.20/8.71 [2019-03-28 12:44:49,710 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 19.20/8.71 [2019-03-28 12:44:49,710 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 19.20/8.71 [2019-03-28 12:44:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.20/8.71 [2019-03-28 12:44:49,848 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.20/8.71 [2019-03-28 12:44:49,848 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 10 predicates after loop cannibalization 19.20/8.71 [2019-03-28 12:44:49,852 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates 19.20/8.71 [2019-03-28 12:44:49,852 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states. Second operand 8 states. 19.20/8.71 [2019-03-28 12:44:50,543 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states.. Second operand 8 states. Result 74 states and 128 transitions. Complement of second has 24 states. 19.20/8.71 [2019-03-28 12:44:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states 19.20/8.71 [2019-03-28 12:44:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 19.20/8.71 [2019-03-28 12:44:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. 19.20/8.71 [2019-03-28 12:44:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 101 transitions. Stem has 3 letters. Loop has 6 letters. 19.20/8.71 [2019-03-28 12:44:50,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.20/8.71 [2019-03-28 12:44:50,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 101 transitions. Stem has 9 letters. Loop has 6 letters. 19.20/8.71 [2019-03-28 12:44:50,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.20/8.71 [2019-03-28 12:44:50,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 101 transitions. Stem has 3 letters. Loop has 12 letters. 19.20/8.71 [2019-03-28 12:44:50,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.20/8.71 [2019-03-28 12:44:50,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 128 transitions. 19.20/8.71 [2019-03-28 12:44:50,562 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.20/8.71 [2019-03-28 12:44:50,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:50,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.20/8.71 [2019-03-28 12:44:50,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.20/8.71 [2019-03-28 12:44:50,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:50,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.20/8.71 [2019-03-28 12:44:50,564 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:50,564 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:50,564 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:50,565 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.20/8.71 [2019-03-28 12:44:50,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.20/8.71 [2019-03-28 12:44:50,565 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.20/8.71 [2019-03-28 12:44:50,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.20/8.71 [2019-03-28 12:44:50,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:50 BasicIcfg 19.20/8.71 [2019-03-28 12:44:50,571 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.20/8.71 [2019-03-28 12:44:50,571 INFO L168 Benchmark]: Toolchain (without parser) took 4301.02 ms. Allocated memory was 649.6 MB in the beginning and 742.4 MB in the end (delta: 92.8 MB). Free memory was 564.9 MB in the beginning and 451.3 MB in the end (delta: 113.6 MB). Peak memory consumption was 206.4 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,572 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.10 ms. Allocated memory was 649.6 MB in the beginning and 670.6 MB in the end (delta: 21.0 MB). Free memory was 564.9 MB in the beginning and 638.2 MB in the end (delta: -73.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 670.6 MB. Free memory was 638.2 MB in the beginning and 634.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,574 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 ms. Allocated memory is still 670.6 MB. Free memory was 634.3 MB in the beginning and 633.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,574 INFO L168 Benchmark]: RCFGBuilder took 311.96 ms. Allocated memory is still 670.6 MB. Free memory was 633.2 MB in the beginning and 612.2 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,575 INFO L168 Benchmark]: BlockEncodingV2 took 134.15 ms. Allocated memory is still 670.6 MB. Free memory was 612.2 MB in the beginning and 603.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,575 INFO L168 Benchmark]: TraceAbstraction took 878.89 ms. Allocated memory is still 670.6 MB. Free memory was 603.5 MB in the beginning and 523.5 MB in the end (delta: 80.1 MB). Peak memory consumption was 80.1 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,576 INFO L168 Benchmark]: BuchiAutomizer took 2602.80 ms. Allocated memory was 670.6 MB in the beginning and 742.4 MB in the end (delta: 71.8 MB). Free memory was 522.4 MB in the beginning and 451.3 MB in the end (delta: 71.0 MB). Peak memory consumption was 142.9 MB. Max. memory is 50.3 GB. 19.20/8.71 [2019-03-28 12:44:50,581 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.20/8.71 --- Results --- 19.20/8.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.20/8.71 - StatisticsResult: Initial Icfg 19.20/8.71 30 locations, 31 edges 19.20/8.71 - StatisticsResult: Encoded RCFG 19.20/8.71 23 locations, 40 edges 19.20/8.71 * Results from de.uni_freiburg.informatik.ultimate.core: 19.20/8.71 - StatisticsResult: Toolchain Benchmarks 19.20/8.71 Benchmark results are: 19.20/8.71 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.20/8.71 * CACSL2BoogieTranslator took 303.10 ms. Allocated memory was 649.6 MB in the beginning and 670.6 MB in the end (delta: 21.0 MB). Free memory was 564.9 MB in the beginning and 638.2 MB in the end (delta: -73.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 19.20/8.71 * Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 670.6 MB. Free memory was 638.2 MB in the beginning and 634.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 19.20/8.71 * Boogie Preprocessor took 22.98 ms. Allocated memory is still 670.6 MB. Free memory was 634.3 MB in the beginning and 633.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 19.20/8.71 * RCFGBuilder took 311.96 ms. Allocated memory is still 670.6 MB. Free memory was 633.2 MB in the beginning and 612.2 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. 19.20/8.71 * BlockEncodingV2 took 134.15 ms. Allocated memory is still 670.6 MB. Free memory was 612.2 MB in the beginning and 603.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 19.20/8.71 * TraceAbstraction took 878.89 ms. Allocated memory is still 670.6 MB. Free memory was 603.5 MB in the beginning and 523.5 MB in the end (delta: 80.1 MB). Peak memory consumption was 80.1 MB. Max. memory is 50.3 GB. 19.20/8.71 * BuchiAutomizer took 2602.80 ms. Allocated memory was 670.6 MB in the beginning and 742.4 MB in the end (delta: 71.8 MB). Free memory was 522.4 MB in the beginning and 451.3 MB in the end (delta: 71.0 MB). Peak memory consumption was 142.9 MB. Max. memory is 50.3 GB. 19.20/8.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 19.20/8.71 - GenericResult: Unfinished Backtranslation 19.20/8.71 unknown boogie variable #length 19.20/8.71 - GenericResult: Unfinished Backtranslation 19.20/8.71 unknown boogie variable #length 19.20/8.71 - GenericResult: Unfinished Backtranslation 19.20/8.71 unknown boogie variable #length 19.20/8.71 - GenericResult: Unfinished Backtranslation 19.20/8.71 unknown boogie variable #length 19.20/8.71 - GenericResult: Unfinished Backtranslation 19.20/8.71 unknown boogie variable #memory_int 19.20/8.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.20/8.71 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 9]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 6]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 9]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 9]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 6]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 9]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.20/8.71 For all program executions holds that pointer dereference always succeeds at this location 19.20/8.71 - AllSpecificationsHoldResult: All specifications hold 19.20/8.71 14 specifications checked. All of them hold 19.20/8.71 - InvariantResult [Line: 6]: Loop Invariant 19.20/8.71 [2019-03-28 12:44:50,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:50,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:50,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 [2019-03-28 12:44:50,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.20/8.71 Derived loop invariant: ((((\valid[y] == 1 && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0 19.20/8.71 - StatisticsResult: Ultimate Automizer benchmark data 19.20/8.71 CFG has 1 procedures, 23 locations, 14 error locations. SAFE Result, 0.7s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 86 SDslu, 3 SDs, 0 SdLazy, 94 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 19.20/8.71 - StatisticsResult: Constructed decomposition of program 19.20/8.71 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 14 locations. 19.20/8.71 - StatisticsResult: Timing statistics 19.20/8.71 BüchiAutomizer plugin needed 2.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. 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: 1 SDtfs, 231 SDslu, 1 SDs, 0 SdLazy, 447 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp41 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 19.20/8.71 - TerminationAnalysisResult: Termination proven 19.20/8.71 Buchi Automizer proved that your program is terminating 19.20/8.71 RESULT: Ultimate proved your program to be correct! 19.20/8.71 !SESSION 2019-03-28 12:44:42.977 ----------------------------------------------- 19.20/8.71 eclipse.buildId=unknown 19.20/8.71 java.version=1.8.0_181 19.20/8.71 java.vendor=Oracle Corporation 19.20/8.71 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.20/8.71 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.20/8.71 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 19.20/8.71 19.20/8.71 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:50.815 19.20/8.71 !MESSAGE The workspace will exit with unsaved changes in this session. 19.20/8.71 Received shutdown request... 19.20/8.71 Ultimate: 19.20/8.71 GTK+ Version Check 19.20/8.71 EOF