45.50/19.76 YES 45.50/19.76 45.50/19.76 Ultimate: Cannot open display: 45.50/19.76 This is Ultimate 0.1.24-8dc7c08-m 45.50/19.76 [2019-03-28 12:34:44,422 INFO L170 SettingsManager]: Resetting all preferences to default values... 45.50/19.76 [2019-03-28 12:34:44,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 45.50/19.76 [2019-03-28 12:34:44,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 45.50/19.76 [2019-03-28 12:34:44,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 45.50/19.76 [2019-03-28 12:34:44,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 45.50/19.76 [2019-03-28 12:34:44,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 45.50/19.76 [2019-03-28 12:34:44,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 45.50/19.76 [2019-03-28 12:34:44,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 45.50/19.76 [2019-03-28 12:34:44,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 45.50/19.76 [2019-03-28 12:34:44,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 45.50/19.76 [2019-03-28 12:34:44,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 45.50/19.76 [2019-03-28 12:34:44,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 45.50/19.76 [2019-03-28 12:34:44,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 45.50/19.76 [2019-03-28 12:34:44,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 45.50/19.76 [2019-03-28 12:34:44,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 45.50/19.76 [2019-03-28 12:34:44,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 45.50/19.76 [2019-03-28 12:34:44,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 45.50/19.76 [2019-03-28 12:34:44,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 45.50/19.76 [2019-03-28 12:34:44,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 45.50/19.76 [2019-03-28 12:34:44,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 45.50/19.76 [2019-03-28 12:34:44,463 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 45.50/19.76 [2019-03-28 12:34:44,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 45.50/19.76 [2019-03-28 12:34:44,464 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 45.50/19.76 [2019-03-28 12:34:44,465 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 45.50/19.76 [2019-03-28 12:34:44,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 45.50/19.76 [2019-03-28 12:34:44,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 45.50/19.76 [2019-03-28 12:34:44,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 45.50/19.76 [2019-03-28 12:34:44,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 45.50/19.76 [2019-03-28 12:34:44,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 45.50/19.76 [2019-03-28 12:34:44,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 45.50/19.76 [2019-03-28 12:34:44,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 45.50/19.76 [2019-03-28 12:34:44,474 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 45.50/19.76 [2019-03-28 12:34:44,489 INFO L110 SettingsManager]: Loading preferences was successful 45.50/19.76 [2019-03-28 12:34:44,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 45.50/19.76 [2019-03-28 12:34:44,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 45.50/19.76 [2019-03-28 12:34:44,490 INFO L133 SettingsManager]: * Rewrite not-equals=true 45.50/19.76 [2019-03-28 12:34:44,491 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 45.50/19.76 [2019-03-28 12:34:44,491 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 45.50/19.76 [2019-03-28 12:34:44,491 INFO L133 SettingsManager]: * Use SBE=true 45.50/19.76 [2019-03-28 12:34:44,491 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 45.50/19.76 [2019-03-28 12:34:44,491 INFO L133 SettingsManager]: * Use old map elimination=false 45.50/19.76 [2019-03-28 12:34:44,492 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 45.50/19.76 [2019-03-28 12:34:44,492 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 45.50/19.76 [2019-03-28 12:34:44,492 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 45.50/19.76 [2019-03-28 12:34:44,492 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 45.50/19.76 [2019-03-28 12:34:44,492 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 45.50/19.76 [2019-03-28 12:34:44,493 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 45.50/19.76 [2019-03-28 12:34:44,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 45.50/19.76 [2019-03-28 12:34:44,493 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 45.50/19.76 [2019-03-28 12:34:44,493 INFO L133 SettingsManager]: * Check division by zero=IGNORE 45.50/19.76 [2019-03-28 12:34:44,493 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 45.50/19.76 [2019-03-28 12:34:44,494 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 45.50/19.76 [2019-03-28 12:34:44,494 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 45.50/19.76 [2019-03-28 12:34:44,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 45.50/19.76 [2019-03-28 12:34:44,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 45.50/19.76 [2019-03-28 12:34:44,494 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 45.50/19.76 [2019-03-28 12:34:44,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 45.50/19.76 [2019-03-28 12:34:44,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 45.50/19.76 [2019-03-28 12:34:44,495 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 45.50/19.76 [2019-03-28 12:34:44,495 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 45.50/19.76 [2019-03-28 12:34:44,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 45.50/19.76 [2019-03-28 12:34:44,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 45.50/19.76 [2019-03-28 12:34:44,536 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 45.50/19.76 [2019-03-28 12:34:44,539 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 45.50/19.76 [2019-03-28 12:34:44,541 INFO L271 PluginConnector]: Initializing CDTParser... 45.50/19.76 [2019-03-28 12:34:44,541 INFO L276 PluginConnector]: CDTParser initialized 45.50/19.76 [2019-03-28 12:34:44,542 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 45.50/19.76 [2019-03-28 12:34:44,604 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a6811c1ee8244f56982d9776ae1edf79/FLAG5c578d558 45.50/19.76 [2019-03-28 12:34:44,960 INFO L307 CDTParser]: Found 1 translation units. 45.50/19.76 [2019-03-28 12:34:44,961 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 45.50/19.76 [2019-03-28 12:34:44,961 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 45.50/19.76 [2019-03-28 12:34:44,968 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a6811c1ee8244f56982d9776ae1edf79/FLAG5c578d558 45.50/19.76 [2019-03-28 12:34:45,361 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a6811c1ee8244f56982d9776ae1edf79 45.50/19.76 [2019-03-28 12:34:45,372 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 45.50/19.76 [2019-03-28 12:34:45,374 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 45.50/19.76 [2019-03-28 12:34:45,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 45.50/19.76 [2019-03-28 12:34:45,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 45.50/19.76 [2019-03-28 12:34:45,379 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 45.50/19.76 [2019-03-28 12:34:45,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448c5b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45, skipping insertion in model container 45.50/19.76 [2019-03-28 12:34:45,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 45.50/19.76 [2019-03-28 12:34:45,409 INFO L176 MainTranslator]: Built tables and reachable declarations 45.50/19.76 [2019-03-28 12:34:45,579 INFO L206 PostProcessor]: Analyzing one entry point: main 45.50/19.76 [2019-03-28 12:34:45,591 INFO L191 MainTranslator]: Completed pre-run 45.50/19.76 [2019-03-28 12:34:45,613 INFO L206 PostProcessor]: Analyzing one entry point: main 45.50/19.76 [2019-03-28 12:34:45,699 INFO L195 MainTranslator]: Completed translation 45.50/19.76 [2019-03-28 12:34:45,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45 WrapperNode 45.50/19.76 [2019-03-28 12:34:45,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 45.50/19.76 [2019-03-28 12:34:45,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 45.50/19.76 [2019-03-28 12:34:45,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 45.50/19.76 [2019-03-28 12:34:45,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 45.50/19.76 [2019-03-28 12:34:45,712 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:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,722 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:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 45.50/19.76 [2019-03-28 12:34:45,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 45.50/19.76 [2019-03-28 12:34:45,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 45.50/19.76 [2019-03-28 12:34:45,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized 45.50/19.76 [2019-03-28 12:34:45,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 [2019-03-28 12:34:45,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 45.50/19.76 [2019-03-28 12:34:45,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 45.50/19.76 [2019-03-28 12:34:45,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... 45.50/19.76 [2019-03-28 12:34:45,776 INFO L276 PluginConnector]: RCFGBuilder initialized 45.50/19.76 [2019-03-28 12:34:45,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (1/1) ... 45.50/19.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.76 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 45.50/19.76 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 45.50/19.76 [2019-03-28 12:34:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 45.50/19.76 [2019-03-28 12:34:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 45.50/19.76 [2019-03-28 12:34:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 45.50/19.76 [2019-03-28 12:34:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 45.50/19.76 [2019-03-28 12:34:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 45.50/19.76 [2019-03-28 12:34:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 45.50/19.76 [2019-03-28 12:34:46,102 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 45.50/19.76 [2019-03-28 12:34:46,103 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 45.50/19.76 [2019-03-28 12:34:46,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:46 BoogieIcfgContainer 45.50/19.76 [2019-03-28 12:34:46,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 45.50/19.76 [2019-03-28 12:34:46,105 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 45.50/19.76 [2019-03-28 12:34:46,105 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 45.50/19.76 [2019-03-28 12:34:46,108 INFO L276 PluginConnector]: BlockEncodingV2 initialized 45.50/19.76 [2019-03-28 12:34:46,109 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:46" (1/1) ... 45.50/19.76 [2019-03-28 12:34:46,127 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 34 edges 45.50/19.76 [2019-03-28 12:34:46,129 INFO L258 BlockEncoder]: Using Remove infeasible edges 45.50/19.76 [2019-03-28 12:34:46,130 INFO L263 BlockEncoder]: Using Maximize final states 45.50/19.76 [2019-03-28 12:34:46,131 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 45.50/19.76 [2019-03-28 12:34:46,131 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 45.50/19.76 [2019-03-28 12:34:46,133 INFO L296 BlockEncoder]: Using Remove sink states 45.50/19.76 [2019-03-28 12:34:46,134 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 45.50/19.76 [2019-03-28 12:34:46,134 INFO L179 BlockEncoder]: Using Rewrite not-equals 45.50/19.76 [2019-03-28 12:34:46,156 INFO L185 BlockEncoder]: Using Use SBE 45.50/19.76 [2019-03-28 12:34:46,182 INFO L200 BlockEncoder]: SBE split 11 edges 45.50/19.76 [2019-03-28 12:34:46,187 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 45.50/19.76 [2019-03-28 12:34:46,189 INFO L71 MaximizeFinalStates]: 0 new accepting states 45.50/19.76 [2019-03-28 12:34:46,219 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 45.50/19.76 [2019-03-28 12:34:46,221 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 45.50/19.76 [2019-03-28 12:34:46,223 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 45.50/19.76 [2019-03-28 12:34:46,223 INFO L71 MaximizeFinalStates]: 0 new accepting states 45.50/19.76 [2019-03-28 12:34:46,223 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 45.50/19.76 [2019-03-28 12:34:46,224 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 45.50/19.76 [2019-03-28 12:34:46,224 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 36 edges 45.50/19.76 [2019-03-28 12:34:46,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:46 BasicIcfg 45.50/19.76 [2019-03-28 12:34:46,225 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 45.50/19.76 [2019-03-28 12:34:46,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 45.50/19.76 [2019-03-28 12:34:46,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... 45.50/19.76 [2019-03-28 12:34:46,229 INFO L276 PluginConnector]: TraceAbstraction initialized 45.50/19.76 [2019-03-28 12:34:46,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:34:45" (1/4) ... 45.50/19.76 [2019-03-28 12:34:46,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b3c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:46, skipping insertion in model container 45.50/19.76 [2019-03-28 12:34:46,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (2/4) ... 45.50/19.76 [2019-03-28 12:34:46,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b3c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:46, skipping insertion in model container 45.50/19.76 [2019-03-28 12:34:46,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:46" (3/4) ... 45.50/19.76 [2019-03-28 12:34:46,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b3c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:46, skipping insertion in model container 45.50/19.76 [2019-03-28 12:34:46,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:46" (4/4) ... 45.50/19.76 [2019-03-28 12:34:46,233 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 45.50/19.76 [2019-03-28 12:34:46,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 45.50/19.76 [2019-03-28 12:34:46,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 45.50/19.76 [2019-03-28 12:34:46,269 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 45.50/19.76 [2019-03-28 12:34:46,298 INFO L133 ementStrategyFactory]: Using default assertion order modulation 45.50/19.76 [2019-03-28 12:34:46,298 INFO L382 AbstractCegarLoop]: Interprodecural is true 45.50/19.76 [2019-03-28 12:34:46,299 INFO L383 AbstractCegarLoop]: Hoare is true 45.50/19.76 [2019-03-28 12:34:46,299 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 45.50/19.76 [2019-03-28 12:34:46,299 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 45.50/19.76 [2019-03-28 12:34:46,299 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 45.50/19.76 [2019-03-28 12:34:46,299 INFO L387 AbstractCegarLoop]: Difference is false 45.50/19.76 [2019-03-28 12:34:46,299 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 45.50/19.76 [2019-03-28 12:34:46,300 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 45.50/19.76 [2019-03-28 12:34:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. 45.50/19.76 [2019-03-28 12:34:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 45.50/19.76 [2019-03-28 12:34:46,320 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:46,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:46,322 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 159033776, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:46,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:46,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:46,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:46,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:46,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 45.50/19.76 [2019-03-28 12:34:46,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 45.50/19.76 [2019-03-28 12:34:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 45.50/19.76 [2019-03-28 12:34:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 45.50/19.76 [2019-03-28 12:34:46,516 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. 45.50/19.76 [2019-03-28 12:34:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:46,608 INFO L93 Difference]: Finished difference Result 20 states and 36 transitions. 45.50/19.76 [2019-03-28 12:34:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 45.50/19.76 [2019-03-28 12:34:46,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 45.50/19.76 [2019-03-28 12:34:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:46,624 INFO L225 Difference]: With dead ends: 20 45.50/19.76 [2019-03-28 12:34:46,624 INFO L226 Difference]: Without dead ends: 19 45.50/19.76 [2019-03-28 12:34:46,627 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 45.50/19.76 [2019-03-28 12:34:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 45.50/19.76 [2019-03-28 12:34:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. 45.50/19.76 [2019-03-28 12:34:46,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 5 45.50/19.76 [2019-03-28 12:34:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:46,667 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. 45.50/19.76 [2019-03-28 12:34:46,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 45.50/19.76 [2019-03-28 12:34:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. 45.50/19.76 [2019-03-28 12:34:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 45.50/19.76 [2019-03-28 12:34:46,668 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:46,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:46,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash 159033778, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:46,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:46,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:46,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:46,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 45.50/19.76 [2019-03-28 12:34:46,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 45.50/19.76 [2019-03-28 12:34:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 45.50/19.76 [2019-03-28 12:34:46,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 45.50/19.76 [2019-03-28 12:34:46,708 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 4 states. 45.50/19.76 [2019-03-28 12:34:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:46,781 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. 45.50/19.76 [2019-03-28 12:34:46,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 45.50/19.76 [2019-03-28 12:34:46,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 45.50/19.76 [2019-03-28 12:34:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:46,782 INFO L225 Difference]: With dead ends: 20 45.50/19.76 [2019-03-28 12:34:46,782 INFO L226 Difference]: Without dead ends: 19 45.50/19.76 [2019-03-28 12:34:46,784 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 45.50/19.76 [2019-03-28 12:34:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 45.50/19.76 [2019-03-28 12:34:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. 45.50/19.76 [2019-03-28 12:34:46,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 5 45.50/19.76 [2019-03-28 12:34:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:46,788 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. 45.50/19.76 [2019-03-28 12:34:46,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 45.50/19.76 [2019-03-28 12:34:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. 45.50/19.76 [2019-03-28 12:34:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 45.50/19.76 [2019-03-28 12:34:46,789 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:46,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:46,789 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash 159033779, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:46,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:46,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:46,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 45.50/19.76 [2019-03-28 12:34:46,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 45.50/19.76 [2019-03-28 12:34:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 45.50/19.76 [2019-03-28 12:34:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 45.50/19.76 [2019-03-28 12:34:46,825 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 3 states. 45.50/19.76 [2019-03-28 12:34:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:46,878 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. 45.50/19.76 [2019-03-28 12:34:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 45.50/19.76 [2019-03-28 12:34:46,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 45.50/19.76 [2019-03-28 12:34:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:46,879 INFO L225 Difference]: With dead ends: 19 45.50/19.76 [2019-03-28 12:34:46,879 INFO L226 Difference]: Without dead ends: 18 45.50/19.76 [2019-03-28 12:34:46,880 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 45.50/19.76 [2019-03-28 12:34:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 45.50/19.76 [2019-03-28 12:34:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 45.50/19.76 [2019-03-28 12:34:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 45.50/19.76 [2019-03-28 12:34:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:46,884 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 5 45.50/19.76 [2019-03-28 12:34:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:46,884 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:46,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 45.50/19.76 [2019-03-28 12:34:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 45.50/19.76 [2019-03-28 12:34:46,885 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:46,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:46,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1787341292, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:46,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:46,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:46,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:46,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 45.50/19.76 [2019-03-28 12:34:46,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 45.50/19.76 [2019-03-28 12:34:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 45.50/19.76 [2019-03-28 12:34:46,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 45.50/19.76 [2019-03-28 12:34:46,939 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 4 states. 45.50/19.76 [2019-03-28 12:34:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:47,038 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:47,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 45.50/19.76 [2019-03-28 12:34:47,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 45.50/19.76 [2019-03-28 12:34:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:47,039 INFO L225 Difference]: With dead ends: 18 45.50/19.76 [2019-03-28 12:34:47,039 INFO L226 Difference]: Without dead ends: 17 45.50/19.76 [2019-03-28 12:34:47,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 45.50/19.76 [2019-03-28 12:34:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 45.50/19.76 [2019-03-28 12:34:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 45.50/19.76 [2019-03-28 12:34:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 45.50/19.76 [2019-03-28 12:34:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. 45.50/19.76 [2019-03-28 12:34:47,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 7 45.50/19.76 [2019-03-28 12:34:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:47,044 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. 45.50/19.76 [2019-03-28 12:34:47,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 45.50/19.76 [2019-03-28 12:34:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. 45.50/19.76 [2019-03-28 12:34:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 45.50/19.76 [2019-03-28 12:34:47,045 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:47,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:47,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1787341290, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:47,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:47,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:47,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:47,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.76 [2019-03-28 12:34:47,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 45.50/19.76 [2019-03-28 12:34:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 45.50/19.76 [2019-03-28 12:34:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 45.50/19.76 [2019-03-28 12:34:47,120 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. 45.50/19.76 [2019-03-28 12:34:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:47,262 INFO L93 Difference]: Finished difference Result 24 states and 42 transitions. 45.50/19.76 [2019-03-28 12:34:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 45.50/19.76 [2019-03-28 12:34:47,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 45.50/19.76 [2019-03-28 12:34:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:47,288 INFO L225 Difference]: With dead ends: 24 45.50/19.76 [2019-03-28 12:34:47,288 INFO L226 Difference]: Without dead ends: 23 45.50/19.76 [2019-03-28 12:34:47,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 45.50/19.76 [2019-03-28 12:34:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 45.50/19.76 [2019-03-28 12:34:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. 45.50/19.76 [2019-03-28 12:34:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:47,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 7 45.50/19.76 [2019-03-28 12:34:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:47,294 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 45.50/19.76 [2019-03-28 12:34:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. 45.50/19.76 [2019-03-28 12:34:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 45.50/19.76 [2019-03-28 12:34:47,295 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:47,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:47,295 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 426993808, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:47,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:47,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:47,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.76 [2019-03-28 12:34:47,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 45.50/19.76 [2019-03-28 12:34:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 45.50/19.76 [2019-03-28 12:34:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 45.50/19.76 [2019-03-28 12:34:47,398 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 6 states. 45.50/19.76 [2019-03-28 12:34:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:47,538 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. 45.50/19.76 [2019-03-28 12:34:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 45.50/19.76 [2019-03-28 12:34:47,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 45.50/19.76 [2019-03-28 12:34:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:47,540 INFO L225 Difference]: With dead ends: 23 45.50/19.76 [2019-03-28 12:34:47,540 INFO L226 Difference]: Without dead ends: 22 45.50/19.76 [2019-03-28 12:34:47,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 45.50/19.76 [2019-03-28 12:34:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 45.50/19.76 [2019-03-28 12:34:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. 45.50/19.76 [2019-03-28 12:34:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 45.50/19.76 [2019-03-28 12:34:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. 45.50/19.76 [2019-03-28 12:34:47,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 8 45.50/19.76 [2019-03-28 12:34:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:47,545 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. 45.50/19.76 [2019-03-28 12:34:47,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 45.50/19.76 [2019-03-28 12:34:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. 45.50/19.76 [2019-03-28 12:34:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 45.50/19.76 [2019-03-28 12:34:47,546 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:47,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:47,546 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash 426993806, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:47,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:47,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:47,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:47,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.76 [2019-03-28 12:34:47,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 45.50/19.76 [2019-03-28 12:34:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 45.50/19.76 [2019-03-28 12:34:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 45.50/19.76 [2019-03-28 12:34:47,618 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 6 states. 45.50/19.76 [2019-03-28 12:34:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:47,735 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. 45.50/19.76 [2019-03-28 12:34:47,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 45.50/19.76 [2019-03-28 12:34:47,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 45.50/19.76 [2019-03-28 12:34:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:47,737 INFO L225 Difference]: With dead ends: 20 45.50/19.76 [2019-03-28 12:34:47,737 INFO L226 Difference]: Without dead ends: 19 45.50/19.76 [2019-03-28 12:34:47,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 45.50/19.76 [2019-03-28 12:34:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 45.50/19.76 [2019-03-28 12:34:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 45.50/19.76 [2019-03-28 12:34:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. 45.50/19.76 [2019-03-28 12:34:47,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 45.50/19.76 [2019-03-28 12:34:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:47,743 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. 45.50/19.76 [2019-03-28 12:34:47,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 45.50/19.76 [2019-03-28 12:34:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. 45.50/19.76 [2019-03-28 12:34:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 45.50/19.76 [2019-03-28 12:34:47,743 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:47,743 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:47,744 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1121839631, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:47,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:47,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:47,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:47,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.76 [2019-03-28 12:34:47,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 45.50/19.76 [2019-03-28 12:34:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 45.50/19.76 [2019-03-28 12:34:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 45.50/19.76 [2019-03-28 12:34:47,788 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. 45.50/19.76 [2019-03-28 12:34:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:47,922 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. 45.50/19.76 [2019-03-28 12:34:47,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 45.50/19.76 [2019-03-28 12:34:47,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 45.50/19.76 [2019-03-28 12:34:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:47,924 INFO L225 Difference]: With dead ends: 42 45.50/19.76 [2019-03-28 12:34:47,924 INFO L226 Difference]: Without dead ends: 30 45.50/19.76 [2019-03-28 12:34:47,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 45.50/19.76 [2019-03-28 12:34:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 45.50/19.76 [2019-03-28 12:34:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. 45.50/19.76 [2019-03-28 12:34:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 45.50/19.76 [2019-03-28 12:34:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. 45.50/19.76 [2019-03-28 12:34:47,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 11 45.50/19.76 [2019-03-28 12:34:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:47,930 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. 45.50/19.76 [2019-03-28 12:34:47,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 45.50/19.76 [2019-03-28 12:34:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. 45.50/19.76 [2019-03-28 12:34:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 45.50/19.76 [2019-03-28 12:34:47,931 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:47,931 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:47,931 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:47,932 INFO L82 PathProgramCache]: Analyzing trace with hash -638294766, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:47,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:47,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:47,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:48,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:48,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 45.50/19.76 [2019-03-28 12:34:48,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 45.50/19.76 [2019-03-28 12:34:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 45.50/19.76 [2019-03-28 12:34:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 45.50/19.76 [2019-03-28 12:34:48,013 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 7 states. 45.50/19.76 [2019-03-28 12:34:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:48,153 INFO L93 Difference]: Finished difference Result 54 states and 88 transitions. 45.50/19.76 [2019-03-28 12:34:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 45.50/19.76 [2019-03-28 12:34:48,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 45.50/19.76 [2019-03-28 12:34:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:48,158 INFO L225 Difference]: With dead ends: 54 45.50/19.76 [2019-03-28 12:34:48,158 INFO L226 Difference]: Without dead ends: 43 45.50/19.76 [2019-03-28 12:34:48,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 45.50/19.76 [2019-03-28 12:34:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 45.50/19.76 [2019-03-28 12:34:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. 45.50/19.76 [2019-03-28 12:34:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 45.50/19.76 [2019-03-28 12:34:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. 45.50/19.76 [2019-03-28 12:34:48,165 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 11 45.50/19.76 [2019-03-28 12:34:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:48,165 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. 45.50/19.76 [2019-03-28 12:34:48,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 45.50/19.76 [2019-03-28 12:34:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. 45.50/19.76 [2019-03-28 12:34:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 45.50/19.76 [2019-03-28 12:34:48,166 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:48,166 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:48,166 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1227835281, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:48,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:48,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:48,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:48,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.76 [2019-03-28 12:34:48,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.76 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.76 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.76 [2019-03-28 12:34:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:48,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 28 conjunts are in the unsatisfiable core 45.50/19.76 [2019-03-28 12:34:48,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.76 [2019-03-28 12:34:48,483 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.76 [2019-03-28 12:34:48,484 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 45.50/19.76 [2019-03-28 12:34:48,484 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.76 [2019-03-28 12:34:48,506 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size 45.50/19.76 [2019-03-28 12:34:48,507 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 45.50/19.76 [2019-03-28 12:34:48,507 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 45.50/19.76 [2019-03-28 12:34:48,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 45.50/19.76 [2019-03-28 12:34:48,533 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.76 [2019-03-28 12:34:48,540 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.76 [2019-03-28 12:34:48,541 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 45.50/19.76 [2019-03-28 12:34:48,542 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 45.50/19.76 [2019-03-28 12:34:48,616 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.76 [2019-03-28 12:34:48,617 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 45.50/19.76 [2019-03-28 12:34:48,621 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 45.50/19.76 [2019-03-28 12:34:48,634 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.76 [2019-03-28 12:34:48,639 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 45.50/19.76 [2019-03-28 12:34:48,640 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 45.50/19.76 [2019-03-28 12:34:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:48,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:48,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 45.50/19.76 [2019-03-28 12:34:48,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 45.50/19.76 [2019-03-28 12:34:48,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 45.50/19.76 [2019-03-28 12:34:48,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 45.50/19.76 [2019-03-28 12:34:48,781 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 15 states. 45.50/19.76 [2019-03-28 12:34:49,166 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 45.50/19.76 [2019-03-28 12:34:49,296 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 45.50/19.76 [2019-03-28 12:34:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:49,539 INFO L93 Difference]: Finished difference Result 34 states and 55 transitions. 45.50/19.76 [2019-03-28 12:34:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 45.50/19.76 [2019-03-28 12:34:49,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 45.50/19.76 [2019-03-28 12:34:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:49,540 INFO L225 Difference]: With dead ends: 34 45.50/19.76 [2019-03-28 12:34:49,540 INFO L226 Difference]: Without dead ends: 33 45.50/19.76 [2019-03-28 12:34:49,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 45.50/19.76 [2019-03-28 12:34:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 45.50/19.76 [2019-03-28 12:34:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. 45.50/19.76 [2019-03-28 12:34:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 45.50/19.76 [2019-03-28 12:34:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,546 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 11 45.50/19.76 [2019-03-28 12:34:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:49,547 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 45.50/19.76 [2019-03-28 12:34:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 45.50/19.76 [2019-03-28 12:34:49,547 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:49,548 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:49,548 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1227835280, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:49,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:49,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:49,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:49,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.76 [2019-03-28 12:34:49,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.76 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.76 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.76 [2019-03-28 12:34:49,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:49,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core 45.50/19.76 [2019-03-28 12:34:49,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.76 [2019-03-28 12:34:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:49,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:49,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 45.50/19.76 [2019-03-28 12:34:49,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 45.50/19.76 [2019-03-28 12:34:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 45.50/19.76 [2019-03-28 12:34:49,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 45.50/19.76 [2019-03-28 12:34:49,681 INFO L87 Difference]: Start difference. First operand 29 states and 48 transitions. Second operand 8 states. 45.50/19.76 [2019-03-28 12:34:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:49,811 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 45.50/19.76 [2019-03-28 12:34:49,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 45.50/19.76 [2019-03-28 12:34:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:49,812 INFO L225 Difference]: With dead ends: 30 45.50/19.76 [2019-03-28 12:34:49,812 INFO L226 Difference]: Without dead ends: 29 45.50/19.76 [2019-03-28 12:34:49,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 45.50/19.76 [2019-03-28 12:34:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 45.50/19.76 [2019-03-28 12:34:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 45.50/19.76 [2019-03-28 12:34:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 45.50/19.76 [2019-03-28 12:34:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. 45.50/19.76 [2019-03-28 12:34:49,818 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 11 45.50/19.76 [2019-03-28 12:34:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:49,818 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. 45.50/19.76 [2019-03-28 12:34:49,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 45.50/19.76 [2019-03-28 12:34:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. 45.50/19.76 [2019-03-28 12:34:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.76 [2019-03-28 12:34:49,819 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:49,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:49,819 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash -418787049, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:49,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:49,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:49,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.76 [2019-03-28 12:34:49,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 45.50/19.76 [2019-03-28 12:34:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 45.50/19.76 [2019-03-28 12:34:49,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 45.50/19.76 [2019-03-28 12:34:49,855 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 5 states. 45.50/19.76 [2019-03-28 12:34:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:49,925 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. 45.50/19.76 [2019-03-28 12:34:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 45.50/19.76 [2019-03-28 12:34:49,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 45.50/19.76 [2019-03-28 12:34:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:49,926 INFO L225 Difference]: With dead ends: 36 45.50/19.76 [2019-03-28 12:34:49,926 INFO L226 Difference]: Without dead ends: 31 45.50/19.76 [2019-03-28 12:34:49,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 45.50/19.76 [2019-03-28 12:34:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 45.50/19.76 [2019-03-28 12:34:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 45.50/19.76 [2019-03-28 12:34:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 45.50/19.76 [2019-03-28 12:34:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,932 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 12 45.50/19.76 [2019-03-28 12:34:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:49,932 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 45.50/19.76 [2019-03-28 12:34:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. 45.50/19.76 [2019-03-28 12:34:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.76 [2019-03-28 12:34:49,933 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:49,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:49,933 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash -418787018, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:49,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:49,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.76 [2019-03-28 12:34:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.76 [2019-03-28 12:34:49,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.76 [2019-03-28 12:34:49,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 45.50/19.76 [2019-03-28 12:34:49,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 45.50/19.76 [2019-03-28 12:34:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 45.50/19.76 [2019-03-28 12:34:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 45.50/19.76 [2019-03-28 12:34:49,987 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 7 states. 45.50/19.76 [2019-03-28 12:34:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.76 [2019-03-28 12:34:50,127 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. 45.50/19.76 [2019-03-28 12:34:50,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 45.50/19.76 [2019-03-28 12:34:50,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 45.50/19.76 [2019-03-28 12:34:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.76 [2019-03-28 12:34:50,128 INFO L225 Difference]: With dead ends: 44 45.50/19.76 [2019-03-28 12:34:50,128 INFO L226 Difference]: Without dead ends: 31 45.50/19.76 [2019-03-28 12:34:50,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 45.50/19.76 [2019-03-28 12:34:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 45.50/19.76 [2019-03-28 12:34:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 45.50/19.76 [2019-03-28 12:34:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 45.50/19.76 [2019-03-28 12:34:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. 45.50/19.76 [2019-03-28 12:34:50,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 12 45.50/19.76 [2019-03-28 12:34:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.76 [2019-03-28 12:34:50,134 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. 45.50/19.76 [2019-03-28 12:34:50,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 45.50/19.76 [2019-03-28 12:34:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. 45.50/19.76 [2019-03-28 12:34:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.76 [2019-03-28 12:34:50,135 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.76 [2019-03-28 12:34:50,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.76 [2019-03-28 12:34:50,135 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.76 [2019-03-28 12:34:50,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.76 [2019-03-28 12:34:50,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1686201909, now seen corresponding path program 1 times 45.50/19.76 [2019-03-28 12:34:50,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.76 [2019-03-28 12:34:50,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.76 [2019-03-28 12:34:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.76 [2019-03-28 12:34:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:50,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:50,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.77 [2019-03-28 12:34:50,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 45.50/19.77 [2019-03-28 12:34:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 45.50/19.77 [2019-03-28 12:34:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 45.50/19.77 [2019-03-28 12:34:50,199 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 6 states. 45.50/19.77 [2019-03-28 12:34:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:50,303 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. 45.50/19.77 [2019-03-28 12:34:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 45.50/19.77 [2019-03-28 12:34:50,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 45.50/19.77 [2019-03-28 12:34:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:50,305 INFO L225 Difference]: With dead ends: 31 45.50/19.77 [2019-03-28 12:34:50,305 INFO L226 Difference]: Without dead ends: 30 45.50/19.77 [2019-03-28 12:34:50,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 45.50/19.77 [2019-03-28 12:34:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 45.50/19.77 [2019-03-28 12:34:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 45.50/19.77 [2019-03-28 12:34:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 45.50/19.77 [2019-03-28 12:34:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. 45.50/19.77 [2019-03-28 12:34:50,311 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 12 45.50/19.77 [2019-03-28 12:34:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:50,311 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. 45.50/19.77 [2019-03-28 12:34:50,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 45.50/19.77 [2019-03-28 12:34:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. 45.50/19.77 [2019-03-28 12:34:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.77 [2019-03-28 12:34:50,312 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:50,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:50,313 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1686201911, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:50,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:50,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:50,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:50,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 45.50/19.77 [2019-03-28 12:34:50,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 45.50/19.77 [2019-03-28 12:34:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 45.50/19.77 [2019-03-28 12:34:50,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 45.50/19.77 [2019-03-28 12:34:50,410 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 9 states. 45.50/19.77 [2019-03-28 12:34:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:50,632 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. 45.50/19.77 [2019-03-28 12:34:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 45.50/19.77 [2019-03-28 12:34:50,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 45.50/19.77 [2019-03-28 12:34:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:50,634 INFO L225 Difference]: With dead ends: 33 45.50/19.77 [2019-03-28 12:34:50,634 INFO L226 Difference]: Without dead ends: 32 45.50/19.77 [2019-03-28 12:34:50,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 45.50/19.77 [2019-03-28 12:34:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 45.50/19.77 [2019-03-28 12:34:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. 45.50/19.77 [2019-03-28 12:34:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 45.50/19.77 [2019-03-28 12:34:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. 45.50/19.77 [2019-03-28 12:34:50,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 12 45.50/19.77 [2019-03-28 12:34:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:50,639 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. 45.50/19.77 [2019-03-28 12:34:50,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 45.50/19.77 [2019-03-28 12:34:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. 45.50/19.77 [2019-03-28 12:34:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.77 [2019-03-28 12:34:50,640 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:50,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:50,640 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1686201912, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:50,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:50,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 45.50/19.77 [2019-03-28 12:34:50,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 45.50/19.77 [2019-03-28 12:34:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 45.50/19.77 [2019-03-28 12:34:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 45.50/19.77 [2019-03-28 12:34:50,714 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 8 states. 45.50/19.77 [2019-03-28 12:34:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:50,861 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. 45.50/19.77 [2019-03-28 12:34:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 45.50/19.77 [2019-03-28 12:34:50,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 45.50/19.77 [2019-03-28 12:34:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:50,863 INFO L225 Difference]: With dead ends: 32 45.50/19.77 [2019-03-28 12:34:50,863 INFO L226 Difference]: Without dead ends: 31 45.50/19.77 [2019-03-28 12:34:50,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 45.50/19.77 [2019-03-28 12:34:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 45.50/19.77 [2019-03-28 12:34:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 45.50/19.77 [2019-03-28 12:34:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 45.50/19.77 [2019-03-28 12:34:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. 45.50/19.77 [2019-03-28 12:34:50,868 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 12 45.50/19.77 [2019-03-28 12:34:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:50,869 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. 45.50/19.77 [2019-03-28 12:34:50,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 45.50/19.77 [2019-03-28 12:34:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. 45.50/19.77 [2019-03-28 12:34:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.77 [2019-03-28 12:34:50,870 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:50,870 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:50,870 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash 591810903, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:50,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:50,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:50,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.77 [2019-03-28 12:34:50,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.77 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.77 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.77 [2019-03-28 12:34:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:50,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:50,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:51,008 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 45.50/19.77 [2019-03-28 12:34:51,009 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:51,015 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:51,021 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 45.50/19.77 [2019-03-28 12:34:51,021 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:51,030 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:51,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:51,031 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 45.50/19.77 [2019-03-28 12:34:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:51,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:51,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 45.50/19.77 [2019-03-28 12:34:51,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 45.50/19.77 [2019-03-28 12:34:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 45.50/19.77 [2019-03-28 12:34:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 45.50/19.77 [2019-03-28 12:34:51,125 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 11 states. 45.50/19.77 [2019-03-28 12:34:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:51,371 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. 45.50/19.77 [2019-03-28 12:34:51,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 45.50/19.77 [2019-03-28 12:34:51,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 45.50/19.77 [2019-03-28 12:34:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:51,372 INFO L225 Difference]: With dead ends: 42 45.50/19.77 [2019-03-28 12:34:51,372 INFO L226 Difference]: Without dead ends: 41 45.50/19.77 [2019-03-28 12:34:51,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 45.50/19.77 [2019-03-28 12:34:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 45.50/19.77 [2019-03-28 12:34:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. 45.50/19.77 [2019-03-28 12:34:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 45.50/19.77 [2019-03-28 12:34:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. 45.50/19.77 [2019-03-28 12:34:51,378 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 12 45.50/19.77 [2019-03-28 12:34:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:51,378 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. 45.50/19.77 [2019-03-28 12:34:51,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 45.50/19.77 [2019-03-28 12:34:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. 45.50/19.77 [2019-03-28 12:34:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 45.50/19.77 [2019-03-28 12:34:51,379 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:51,379 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:51,380 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 591810904, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:51,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:51,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:51,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:51,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.77 [2019-03-28 12:34:51,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.77 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.77 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.77 [2019-03-28 12:34:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:51,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:51,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:51,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 45.50/19.77 [2019-03-28 12:34:51,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 45.50/19.77 [2019-03-28 12:34:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 45.50/19.77 [2019-03-28 12:34:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 45.50/19.77 [2019-03-28 12:34:51,524 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 8 states. 45.50/19.77 [2019-03-28 12:34:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:51,662 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. 45.50/19.77 [2019-03-28 12:34:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 45.50/19.77 [2019-03-28 12:34:51,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 45.50/19.77 [2019-03-28 12:34:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:51,663 INFO L225 Difference]: With dead ends: 31 45.50/19.77 [2019-03-28 12:34:51,663 INFO L226 Difference]: Without dead ends: 30 45.50/19.77 [2019-03-28 12:34:51,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 45.50/19.77 [2019-03-28 12:34:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 45.50/19.77 [2019-03-28 12:34:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 45.50/19.77 [2019-03-28 12:34:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 45.50/19.77 [2019-03-28 12:34:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. 45.50/19.77 [2019-03-28 12:34:51,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 12 45.50/19.77 [2019-03-28 12:34:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:51,668 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. 45.50/19.77 [2019-03-28 12:34:51,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 45.50/19.77 [2019-03-28 12:34:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. 45.50/19.77 [2019-03-28 12:34:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 45.50/19.77 [2019-03-28 12:34:51,669 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:51,669 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:51,670 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:51,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash -296086263, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:51,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:51,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:51,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.77 [2019-03-28 12:34:51,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.77 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.77 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.77 [2019-03-28 12:34:51,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:51,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:51,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:51,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:51,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 45.50/19.77 [2019-03-28 12:34:51,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 45.50/19.77 [2019-03-28 12:34:51,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 45.50/19.77 [2019-03-28 12:34:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 45.50/19.77 [2019-03-28 12:34:51,786 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 5 states. 45.50/19.77 [2019-03-28 12:34:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:51,837 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. 45.50/19.77 [2019-03-28 12:34:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 45.50/19.77 [2019-03-28 12:34:51,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 45.50/19.77 [2019-03-28 12:34:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:51,838 INFO L225 Difference]: With dead ends: 34 45.50/19.77 [2019-03-28 12:34:51,838 INFO L226 Difference]: Without dead ends: 30 45.50/19.77 [2019-03-28 12:34:51,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 45.50/19.77 [2019-03-28 12:34:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 45.50/19.77 [2019-03-28 12:34:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 45.50/19.77 [2019-03-28 12:34:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 45.50/19.77 [2019-03-28 12:34:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. 45.50/19.77 [2019-03-28 12:34:51,843 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 15 45.50/19.77 [2019-03-28 12:34:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:51,843 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. 45.50/19.77 [2019-03-28 12:34:51,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 45.50/19.77 [2019-03-28 12:34:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. 45.50/19.77 [2019-03-28 12:34:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 45.50/19.77 [2019-03-28 12:34:51,844 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:51,844 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:51,844 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -296086232, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:51,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:51,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.77 [2019-03-28 12:34:51,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.77 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.77 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.77 [2019-03-28 12:34:51,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:52,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:52,025 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 45.50/19.77 [2019-03-28 12:34:52,026 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:52,033 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:52,037 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 45.50/19.77 [2019-03-28 12:34:52,038 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:52,046 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:52,047 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:52,047 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 45.50/19.77 [2019-03-28 12:34:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:52,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:52,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 45.50/19.77 [2019-03-28 12:34:52,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 45.50/19.77 [2019-03-28 12:34:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 45.50/19.77 [2019-03-28 12:34:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 45.50/19.77 [2019-03-28 12:34:52,220 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 19 states. 45.50/19.77 [2019-03-28 12:34:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:52,756 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. 45.50/19.77 [2019-03-28 12:34:52,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 45.50/19.77 [2019-03-28 12:34:52,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 45.50/19.77 [2019-03-28 12:34:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:52,809 INFO L225 Difference]: With dead ends: 39 45.50/19.77 [2019-03-28 12:34:52,809 INFO L226 Difference]: Without dead ends: 16 45.50/19.77 [2019-03-28 12:34:52,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 45.50/19.77 [2019-03-28 12:34:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 45.50/19.77 [2019-03-28 12:34:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 45.50/19.77 [2019-03-28 12:34:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 45.50/19.77 [2019-03-28 12:34:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 45.50/19.77 [2019-03-28 12:34:52,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 15 45.50/19.77 [2019-03-28 12:34:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:52,813 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. 45.50/19.77 [2019-03-28 12:34:52,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 45.50/19.77 [2019-03-28 12:34:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. 45.50/19.77 [2019-03-28 12:34:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 45.50/19.77 [2019-03-28 12:34:52,814 INFO L394 BasicCegarLoop]: Found error trace 45.50/19.77 [2019-03-28 12:34:52,814 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:52,814 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 45.50/19.77 [2019-03-28 12:34:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash -203381814, now seen corresponding path program 2 times 45.50/19.77 [2019-03-28 12:34:52,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:52,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:52,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:53,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.77 [2019-03-28 12:34:53,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.77 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.77 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.77 [2019-03-28 12:34:53,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 45.50/19.77 [2019-03-28 12:34:53,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 45.50/19.77 [2019-03-28 12:34:53,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:53,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 47 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:53,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:53,079 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 45.50/19.77 [2019-03-28 12:34:53,079 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,085 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:53,088 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 45.50/19.77 [2019-03-28 12:34:53,089 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:53,098 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,098 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 45.50/19.77 [2019-03-28 12:34:53,119 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 45.50/19.77 [2019-03-28 12:34:53,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,123 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:53,124 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,124 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 45.50/19.77 [2019-03-28 12:34:53,166 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 45.50/19.77 [2019-03-28 12:34:53,167 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,173 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:53,173 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,173 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 45.50/19.77 [2019-03-28 12:34:53,221 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:53,221 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 45.50/19.77 [2019-03-28 12:34:53,222 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,230 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 45.50/19.77 [2019-03-28 12:34:53,232 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 45.50/19.77 [2019-03-28 12:34:53,232 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 45.50/19.77 [2019-03-28 12:34:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:53,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:53,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 45.50/19.77 [2019-03-28 12:34:53,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 45.50/19.77 [2019-03-28 12:34:53,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 45.50/19.77 [2019-03-28 12:34:53,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 45.50/19.77 [2019-03-28 12:34:53,293 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 17 states. 45.50/19.77 [2019-03-28 12:34:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:53,895 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. 45.50/19.77 [2019-03-28 12:34:53,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 45.50/19.77 [2019-03-28 12:34:53,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 45.50/19.77 [2019-03-28 12:34:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 45.50/19.77 [2019-03-28 12:34:53,896 INFO L225 Difference]: With dead ends: 18 45.50/19.77 [2019-03-28 12:34:53,896 INFO L226 Difference]: Without dead ends: 0 45.50/19.77 [2019-03-28 12:34:53,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 45.50/19.77 [2019-03-28 12:34:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 45.50/19.77 [2019-03-28 12:34:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 45.50/19.77 [2019-03-28 12:34:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 45.50/19.77 [2019-03-28 12:34:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:34:53,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 45.50/19.77 [2019-03-28 12:34:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. 45.50/19.77 [2019-03-28 12:34:53,898 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:34:53,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 45.50/19.77 [2019-03-28 12:34:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:34:53,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 45.50/19.77 [2019-03-28 12:34:53,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:34:54,712 WARN L188 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 45.50/19.77 [2019-03-28 12:34:54,925 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 28 42) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,928 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 36) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,929 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,929 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 21) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,929 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 21) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 1 ULTIMATE.start_main_~length~0) (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (= ULTIMATE.start_main_~nondetArea~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1) (<= 1 ULTIMATE.start_main_~n~0) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src~0.base)))) (.cse1 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse2 (<= 0 ULTIMATE.start_cstrncpy_~n)) (.cse4 (<= 1 ULTIMATE.start_cstrncpy_~src~0.offset)) (.cse3 (<= 0 ULTIMATE.start_cstrncpy_~n2~0))) (or (and (<= ULTIMATE.start_cstrncpy_~n2~0 0) (<= ULTIMATE.start_cstrncpy_~n 0) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~n~0 1) .cse4) (and (and (<= 1 ULTIMATE.start_cstrncpy_~dst~0.offset) (<= 1 ULTIMATE.start_cstrncpy_~us~0.offset) .cse0 .cse1 .cse2 (= (select |#valid| ULTIMATE.start_cstrncpy_~us~0.base) 1) (<= (+ ULTIMATE.start_cstrncpy_~n ULTIMATE.start_cstrncpy_~dst~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~dst~0.base)) .cse4) .cse3 (<= (+ ULTIMATE.start_cstrncpy_~us~0.offset ULTIMATE.start_cstrncpy_~n2~0) (select |#length| ULTIMATE.start_cstrncpy_~us~0.base))))) 45.50/19.77 [2019-03-28 12:34:54,929 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,929 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,929 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 23) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,930 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 24) the Hoare annotation is: (let ((.cse20 (select |#length| ULTIMATE.start_cstrncpy_~dst~0.base)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrncpy_~src~0.base)) (.cse19 (select |#length| ULTIMATE.start_cstrncpy_~src~0.base))) (let ((.cse11 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse15 (= (select .cse21 (+ .cse19 (- 1))) 0)) (.cse18 (not (= ULTIMATE.start_cstrncpy_~src~0.base ULTIMATE.start_cstrncpy_~dst~0.base))) (.cse14 (<= ULTIMATE.start_cstrncpy_~n .cse20)) (.cse1 (<= 1 ULTIMATE.start_main_~length~0)) (.cse9 (<= ULTIMATE.start_main_~n~0 1)) (.cse2 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse12 (= 0 ULTIMATE.start_cstrncpy_~dst~0.offset)) (.cse3 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse4 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse5 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse13 (<= 1 .cse19)) (.cse7 (<= 1 ULTIMATE.start_main_~n~0)) (.cse0 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse16 (<= 1 .cse20)) (.cse6 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst~0.base))) (.cse17 (= ULTIMATE.start_cstrncpy_~src~0.offset 0)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src~0.base)))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_cstrncpy_~n 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse7 .cse14 .cse0 .cse15 .cse16 .cse6 .cse8 .cse17 .cse18 .cse10) (and (<= 1 ULTIMATE.start_cstrncpy_~dst~0.offset) .cse11 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_cstrncpy_~src~0.offset 1) .cse19) .cse4 .cse5 (<= 0 ULTIMATE.start_cstrncpy_~n) .cse7 .cse0 .cse15 .cse6 .cse8 (<= (+ ULTIMATE.start_cstrncpy_~n ULTIMATE.start_cstrncpy_~dst~0.offset) .cse20) .cse18 (<= 1 ULTIMATE.start_cstrncpy_~src~0.offset) .cse10) (and (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src~0.base) (+ (select |#length| ULTIMATE.start_cstrncpy_~src~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= ULTIMATE.start_cstrncpy_~src~0.offset ULTIMATE.start_main_~nondetString~0.offset))) .cse14 (or (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse7 (<= ULTIMATE.start_cstrncpy_~n 1) .cse0 .cse6 .cse8 .cse17 .cse9 .cse10) (and .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 (= 0 (select .cse21 ULTIMATE.start_cstrncpy_~src~0.offset)) .cse7 (= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse0 .cse16 .cse6 .cse8 .cse17 .cse10)))))) 45.50/19.77 [2019-03-28 12:34:54,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,930 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. 45.50/19.77 [2019-03-28 12:34:54,931 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 45.50/19.77 [2019-03-28 12:34:54,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:34:54,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:34:54,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:34:54,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,953 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:34:54,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:34:54,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:34:54,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:34:54,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:54,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:54 BasicIcfg 45.50/19.77 [2019-03-28 12:34:54,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 45.50/19.77 [2019-03-28 12:34:54,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 45.50/19.77 [2019-03-28 12:34:54,987 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 45.50/19.77 [2019-03-28 12:34:54,990 INFO L276 PluginConnector]: BuchiAutomizer initialized 45.50/19.77 [2019-03-28 12:34:54,991 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 45.50/19.77 [2019-03-28 12:34:54,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:34:45" (1/5) ... 45.50/19.77 [2019-03-28 12:34:54,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44adf6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:54, skipping insertion in model container 45.50/19.77 [2019-03-28 12:34:54,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 45.50/19.77 [2019-03-28 12:34:54,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:45" (2/5) ... 45.50/19.77 [2019-03-28 12:34:54,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44adf6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:54, skipping insertion in model container 45.50/19.77 [2019-03-28 12:34:54,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 45.50/19.77 [2019-03-28 12:34:54,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:46" (3/5) ... 45.50/19.77 [2019-03-28 12:34:54,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44adf6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:54, skipping insertion in model container 45.50/19.77 [2019-03-28 12:34:54,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 45.50/19.77 [2019-03-28 12:34:54,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:46" (4/5) ... 45.50/19.77 [2019-03-28 12:34:54,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44adf6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:54, skipping insertion in model container 45.50/19.77 [2019-03-28 12:34:54,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 45.50/19.77 [2019-03-28 12:34:54,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:54" (5/5) ... 45.50/19.77 [2019-03-28 12:34:54,995 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 45.50/19.77 [2019-03-28 12:34:55,022 INFO L133 ementStrategyFactory]: Using default assertion order modulation 45.50/19.77 [2019-03-28 12:34:55,022 INFO L374 BuchiCegarLoop]: Interprodecural is true 45.50/19.77 [2019-03-28 12:34:55,022 INFO L375 BuchiCegarLoop]: Hoare is true 45.50/19.77 [2019-03-28 12:34:55,023 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 45.50/19.77 [2019-03-28 12:34:55,023 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 45.50/19.77 [2019-03-28 12:34:55,023 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 45.50/19.77 [2019-03-28 12:34:55,023 INFO L379 BuchiCegarLoop]: Difference is false 45.50/19.77 [2019-03-28 12:34:55,023 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 45.50/19.77 [2019-03-28 12:34:55,023 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 45.50/19.77 [2019-03-28 12:34:55,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. 45.50/19.77 [2019-03-28 12:34:55,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 45.50/19.77 [2019-03-28 12:34:55,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 45.50/19.77 [2019-03-28 12:34:55,031 INFO L119 BuchiIsEmpty]: Starting construction of run 45.50/19.77 [2019-03-28 12:34:55,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:55,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:55,036 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 45.50/19.77 [2019-03-28 12:34:55,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. 45.50/19.77 [2019-03-28 12:34:55,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 45.50/19.77 [2019-03-28 12:34:55,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 45.50/19.77 [2019-03-28 12:34:55,037 INFO L119 BuchiIsEmpty]: Starting construction of run 45.50/19.77 [2019-03-28 12:34:55,037 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:55,037 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:55,043 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 9#L31true [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 6#L31-2true [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 15#L34-1true [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 4#L39true [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 11#L12-2true 45.50/19.77 [2019-03-28 12:34:55,043 INFO L796 eck$LassoCheckResult]: Loop: 11#L12-2true [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 21#L14true [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 19#L14-1true [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 17#L14-2true [130] L14-2-->L12-2: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 11#L12-2true 45.50/19.77 [2019-03-28 12:34:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash 159154976, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:55,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:55,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:55,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash 3243164, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:55,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:55,082 INFO L82 PathProgramCache]: Analyzing trace with hash 594106427, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:55,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:55,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:55,399 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 45.50/19.77 [2019-03-28 12:34:55,500 INFO L216 LassoAnalysis]: Preferences: 45.50/19.77 [2019-03-28 12:34:55,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 45.50/19.77 [2019-03-28 12:34:55,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 45.50/19.77 [2019-03-28 12:34:55,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 45.50/19.77 [2019-03-28 12:34:55,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false 45.50/19.77 [2019-03-28 12:34:55,502 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 45.50/19.77 [2019-03-28 12:34:55,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 45.50/19.77 [2019-03-28 12:34:55,503 INFO L130 ssoRankerPreferences]: Path of dumped script: 45.50/19.77 [2019-03-28 12:34:55,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 45.50/19.77 [2019-03-28 12:34:55,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 45.50/19.77 [2019-03-28 12:34:55,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 45.50/19.77 [2019-03-28 12:34:55,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,779 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 45.50/19.77 [2019-03-28 12:34:55,899 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 45.50/19.77 [2019-03-28 12:34:55,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:55,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:56,431 INFO L300 LassoAnalysis]: Preprocessing complete. 45.50/19.77 [2019-03-28 12:34:56,436 INFO L497 LassoAnalysis]: Using template 'affine'. 45.50/19.77 [2019-03-28 12:34:56,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:56,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:56,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:56,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:56,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:56,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:56,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:56,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:56,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:56,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 45.50/19.77 [2019-03-28 12:34:56,559 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 45.50/19.77 [2019-03-28 12:34:56,559 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. 45.50/19.77 [2019-03-28 12:34:56,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 45.50/19.77 [2019-03-28 12:34:56,563 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 45.50/19.77 [2019-03-28 12:34:56,564 INFO L518 LassoAnalysis]: Proved termination. 45.50/19.77 [2019-03-28 12:34:56,564 INFO L520 LassoAnalysis]: Termination argument consisting of: 45.50/19.77 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrncpy_~src~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrncpy_~src~0.offset 45.50/19.77 Supporting invariants [] 45.50/19.77 [2019-03-28 12:34:56,604 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed 45.50/19.77 [2019-03-28 12:34:56,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:56,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 30 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:56,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:56,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:56,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:56,949 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 45.50/19.77 [2019-03-28 12:34:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:56,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:56,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:56,960 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 45.50/19.77 [2019-03-28 12:34:56,964 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 10 loop predicates 45.50/19.77 [2019-03-28 12:34:56,965 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states. Second operand 5 states. 45.50/19.77 [2019-03-28 12:34:57,505 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states.. Second operand 5 states. Result 48 states and 85 transitions. Complement of second has 13 states. 45.50/19.77 [2019-03-28 12:34:57,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 4 non-accepting loop states 3 accepting loop states 45.50/19.77 [2019-03-28 12:34:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 45.50/19.77 [2019-03-28 12:34:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. 45.50/19.77 [2019-03-28 12:34:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 5 letters. Loop has 4 letters. 45.50/19.77 [2019-03-28 12:34:57,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. 45.50/19.77 [2019-03-28 12:34:57,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 9 letters. Loop has 4 letters. 45.50/19.77 [2019-03-28 12:34:57,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. 45.50/19.77 [2019-03-28 12:34:57,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 5 letters. Loop has 8 letters. 45.50/19.77 [2019-03-28 12:34:57,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. 45.50/19.77 [2019-03-28 12:34:57,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 85 transitions. 45.50/19.77 [2019-03-28 12:34:57,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 45.50/19.77 [2019-03-28 12:34:57,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 19 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 45.50/19.77 [2019-03-28 12:34:57,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 45.50/19.77 [2019-03-28 12:34:57,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 45.50/19.77 [2019-03-28 12:34:57,523 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 45.50/19.77 [2019-03-28 12:34:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 45.50/19.77 [2019-03-28 12:34:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 45.50/19.77 [2019-03-28 12:34:57,525 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 45.50/19.77 [2019-03-28 12:34:57,525 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 45.50/19.77 [2019-03-28 12:34:57,526 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 45.50/19.77 [2019-03-28 12:34:57,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. 45.50/19.77 [2019-03-28 12:34:57,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 45.50/19.77 [2019-03-28 12:34:57,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 45.50/19.77 [2019-03-28 12:34:57,527 INFO L119 BuchiIsEmpty]: Starting construction of run 45.50/19.77 [2019-03-28 12:34:57,527 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:57,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 45.50/19.77 [2019-03-28 12:34:57,528 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 225#L31 [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 226#L31-2 [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 234#L34-1 [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 235#L39 [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 227#L12-2 [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 228#L14 [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 241#L14-1 [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 242#L14-2 [80] L14-2-->L20-3: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_3 v_ULTIMATE.start_cstrncpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_3 v_ULTIMATE.start_cstrncpy_~dst~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) (= v_ULTIMATE.start_cstrncpy_~n2~0_3 v_ULTIMATE.start_cstrncpy_~n_6)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_3, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#t~post2.offset] 232#L20-3 45.50/19.77 [2019-03-28 12:34:57,528 INFO L796 eck$LassoCheckResult]: Loop: 232#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 236#L20-1 [132] L20-1-->L21: Formula: (and (> 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 231#L21 [143] L21-->L20-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 232#L20-3 45.50/19.77 [2019-03-28 12:34:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 594106377, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 98413, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,554 INFO L82 PathProgramCache]: Analyzing trace with hash -537080987, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:57,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:57,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 45.50/19.77 [2019-03-28 12:34:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 45.50/19.77 [2019-03-28 12:34:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 45.50/19.77 [2019-03-28 12:34:57,643 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 12 Second operand 5 states. 45.50/19.77 [2019-03-28 12:34:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:57,700 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 45.50/19.77 [2019-03-28 12:34:57,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 45.50/19.77 [2019-03-28 12:34:57,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 45.50/19.77 [2019-03-28 12:34:57,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 45.50/19.77 [2019-03-28 12:34:57,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 45.50/19.77 [2019-03-28 12:34:57,708 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 45.50/19.77 [2019-03-28 12:34:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 45.50/19.77 [2019-03-28 12:34:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,709 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,709 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,709 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 45.50/19.77 [2019-03-28 12:34:57,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. 45.50/19.77 [2019-03-28 12:34:57,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 45.50/19.77 [2019-03-28 12:34:57,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 45.50/19.77 [2019-03-28 12:34:57,710 INFO L119 BuchiIsEmpty]: Starting construction of run 45.50/19.77 [2019-03-28 12:34:57,711 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:57,711 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 45.50/19.77 [2019-03-28 12:34:57,712 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 277#L31 [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 278#L31-2 [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 286#L34-1 [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 287#L39 [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 279#L12-2 [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 280#L14 [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 294#L14-1 [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 296#L14-2 [80] L14-2-->L20-3: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_3 v_ULTIMATE.start_cstrncpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_3 v_ULTIMATE.start_cstrncpy_~dst~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) (= v_ULTIMATE.start_cstrncpy_~n2~0_3 v_ULTIMATE.start_cstrncpy_~n_6)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_3, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#t~post2.offset] 288#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 289#L20-1 [133] L20-1-->L21: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 283#L21 45.50/19.77 [2019-03-28 12:34:57,712 INFO L796 eck$LassoCheckResult]: Loop: 283#L21 [143] L21-->L20-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 284#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 295#L20-1 [132] L20-1-->L21: Formula: (and (> 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 283#L21 45.50/19.77 [2019-03-28 12:34:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -294419861, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash 169423, now seen corresponding path program 2 times 45.50/19.77 [2019-03-28 12:34:57,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash -738720987, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:57,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 45.50/19.77 [2019-03-28 12:34:57,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 45.50/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 45.50/19.77 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 45.50/19.77 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 45.50/19.77 [2019-03-28 12:34:57,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:57,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:57,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:34:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:34:57,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 45.50/19.77 [2019-03-28 12:34:57,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 45.50/19.77 [2019-03-28 12:34:57,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 45.50/19.77 [2019-03-28 12:34:57,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 45.50/19.77 [2019-03-28 12:34:57,915 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. 45.50/19.77 [2019-03-28 12:34:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 45.50/19.77 [2019-03-28 12:34:57,964 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 45.50/19.77 [2019-03-28 12:34:57,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 45.50/19.77 [2019-03-28 12:34:57,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 45.50/19.77 [2019-03-28 12:34:57,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 45.50/19.77 [2019-03-28 12:34:57,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 45.50/19.77 [2019-03-28 12:34:57,970 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. 45.50/19.77 [2019-03-28 12:34:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. 45.50/19.77 [2019-03-28 12:34:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 45.50/19.77 [2019-03-28 12:34:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. 45.50/19.77 [2019-03-28 12:34:57,971 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. 45.50/19.77 [2019-03-28 12:34:57,971 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. 45.50/19.77 [2019-03-28 12:34:57,971 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 45.50/19.77 [2019-03-28 12:34:57,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. 45.50/19.77 [2019-03-28 12:34:57,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 45.50/19.77 [2019-03-28 12:34:57,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 45.50/19.77 [2019-03-28 12:34:57,972 INFO L119 BuchiIsEmpty]: Starting construction of run 45.50/19.77 [2019-03-28 12:34:57,973 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 45.50/19.77 [2019-03-28 12:34:57,973 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 45.50/19.77 [2019-03-28 12:34:57,974 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 368#L31 [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 369#L31-2 [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 378#L34-1 [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 379#L39 [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 370#L12-2 [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 371#L14 [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 383#L14-1 [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 384#L14-2 [80] L14-2-->L20-3: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_3 v_ULTIMATE.start_cstrncpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_3 v_ULTIMATE.start_cstrncpy_~dst~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) (= v_ULTIMATE.start_cstrncpy_~n2~0_3 v_ULTIMATE.start_cstrncpy_~n_6)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_3, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#t~post2.offset] 375#L20-3 45.50/19.77 [2019-03-28 12:34:57,974 INFO L796 eck$LassoCheckResult]: Loop: 375#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 377#L20-1 [133] L20-1-->L21: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 374#L21 [143] L21-->L20-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 375#L20-3 45.50/19.77 [2019-03-28 12:34:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 594106377, now seen corresponding path program 2 times 45.50/19.77 [2019-03-28 12:34:57,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash 98444, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash -537080956, now seen corresponding path program 1 times 45.50/19.77 [2019-03-28 12:34:57,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 45.50/19.77 [2019-03-28 12:34:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 45.50/19.77 [2019-03-28 12:34:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 45.50/19.77 [2019-03-28 12:34:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:34:58,578 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 45.50/19.77 [2019-03-28 12:34:58,756 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 99 45.50/19.77 [2019-03-28 12:34:58,758 INFO L216 LassoAnalysis]: Preferences: 45.50/19.77 [2019-03-28 12:34:58,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 45.50/19.77 [2019-03-28 12:34:58,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 45.50/19.77 [2019-03-28 12:34:58,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 45.50/19.77 [2019-03-28 12:34:58,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false 45.50/19.77 [2019-03-28 12:34:58,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 45.50/19.77 [2019-03-28 12:34:58,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 45.50/19.77 [2019-03-28 12:34:58,759 INFO L130 ssoRankerPreferences]: Path of dumped script: 45.50/19.77 [2019-03-28 12:34:58,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 45.50/19.77 [2019-03-28 12:34:58,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 45.50/19.77 [2019-03-28 12:34:58,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 45.50/19.77 [2019-03-28 12:34:58,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:58,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 45.50/19.77 [2019-03-28 12:34:59,158 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 45.50/19.77 [2019-03-28 12:34:59,451 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 45.50/19.77 [2019-03-28 12:34:59,793 INFO L300 LassoAnalysis]: Preprocessing complete. 45.50/19.77 [2019-03-28 12:34:59,793 INFO L497 LassoAnalysis]: Using template 'affine'. 45.50/19.77 [2019-03-28 12:34:59,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 45.50/19.77 [2019-03-28 12:34:59,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 45.50/19.77 [2019-03-28 12:34:59,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 45.50/19.77 Termination analysis: LINEAR_WITH_GUESSES 45.50/19.77 Number of strict supporting invariants: 0 45.50/19.77 Number of non-strict supporting invariants: 1 45.50/19.77 Consider only non-deceasing supporting invariants: true 45.50/19.77 Simplify termination arguments: true 45.50/19.77 Simplify supporting invariants: trueOverapproximate stem: false 45.50/19.77 [2019-03-28 12:34:59,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 45.50/19.77 [2019-03-28 12:34:59,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 45.50/19.77 [2019-03-28 12:34:59,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 45.50/19.77 [2019-03-28 12:34:59,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 45.50/19.77 [2019-03-28 12:34:59,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 45.50/19.77 [2019-03-28 12:34:59,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 45.50/19.77 [2019-03-28 12:34:59,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 45.50/19.77 [2019-03-28 12:34:59,895 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 45.50/19.77 [2019-03-28 12:34:59,895 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. 45.50/19.77 [2019-03-28 12:34:59,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 45.50/19.77 [2019-03-28 12:34:59,896 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 45.50/19.77 [2019-03-28 12:34:59,897 INFO L518 LassoAnalysis]: Proved termination. 45.50/19.77 [2019-03-28 12:34:59,897 INFO L520 LassoAnalysis]: Termination argument consisting of: 45.50/19.77 Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0.base)_2 45.50/19.77 Supporting invariants [] 45.50/19.77 [2019-03-28 12:34:59,944 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed 45.50/19.77 [2019-03-28 12:34:59,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:34:59,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 45.50/19.77 [2019-03-28 12:34:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:34:59,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:34:59,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:35:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 45.50/19.77 [2019-03-28 12:35:00,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core 45.50/19.77 [2019-03-28 12:35:00,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... 45.50/19.77 [2019-03-28 12:35:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 45.50/19.77 [2019-03-28 12:35:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 45.50/19.77 [2019-03-28 12:35:00,090 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 45.50/19.77 [2019-03-28 12:35:00,090 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization 45.50/19.77 [2019-03-28 12:35:00,091 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates 45.50/19.77 [2019-03-28 12:35:00,091 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 27 transitions. cyclomatic complexity: 11 Second operand 4 states. 45.50/19.77 [2019-03-28 12:35:00,153 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 27 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 21 states and 31 transitions. Complement of second has 6 states. 45.50/19.77 [2019-03-28 12:35:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 45.50/19.77 [2019-03-28 12:35:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 45.50/19.77 [2019-03-28 12:35:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. 45.50/19.77 [2019-03-28 12:35:00,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 3 letters. 45.50/19.77 [2019-03-28 12:35:00,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. 45.50/19.77 [2019-03-28 12:35:00,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 3 letters. 45.50/19.77 [2019-03-28 12:35:00,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. 45.50/19.77 [2019-03-28 12:35:00,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 6 letters. 45.50/19.77 [2019-03-28 12:35:00,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. 45.50/19.77 [2019-03-28 12:35:00,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. 45.50/19.77 [2019-03-28 12:35:00,158 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 45.50/19.77 [2019-03-28 12:35:00,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:35:00,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 45.50/19.77 [2019-03-28 12:35:00,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 45.50/19.77 [2019-03-28 12:35:00,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:35:00,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 45.50/19.77 [2019-03-28 12:35:00,159 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:35:00,159 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:35:00,159 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:35:00,159 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 45.50/19.77 [2019-03-28 12:35:00,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 45.50/19.77 [2019-03-28 12:35:00,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 45.50/19.77 [2019-03-28 12:35:00,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 45.50/19.77 [2019-03-28 12:35:00,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:00 BasicIcfg 45.50/19.77 [2019-03-28 12:35:00,166 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 45.50/19.77 [2019-03-28 12:35:00,166 INFO L168 Benchmark]: Toolchain (without parser) took 14793.42 ms. Allocated memory was 649.6 MB in the beginning and 918.0 MB in the end (delta: 268.4 MB). Free memory was 566.0 MB in the beginning and 693.5 MB in the end (delta: -127.5 MB). Peak memory consumption was 140.9 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,167 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.45 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 566.0 MB in the beginning and 641.8 MB in the end (delta: -75.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.81 ms. Allocated memory is still 674.2 MB. Free memory was 641.8 MB in the beginning and 637.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,168 INFO L168 Benchmark]: Boogie Preprocessor took 29.40 ms. Allocated memory is still 674.2 MB. Free memory was 637.9 MB in the beginning and 635.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,169 INFO L168 Benchmark]: RCFGBuilder took 329.03 ms. Allocated memory is still 674.2 MB. Free memory was 635.8 MB in the beginning and 612.6 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,169 INFO L168 Benchmark]: BlockEncodingV2 took 120.02 ms. Allocated memory is still 674.2 MB. Free memory was 612.6 MB in the beginning and 603.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,170 INFO L168 Benchmark]: TraceAbstraction took 8759.99 ms. Allocated memory was 674.2 MB in the beginning and 836.2 MB in the end (delta: 162.0 MB). Free memory was 603.9 MB in the beginning and 768.8 MB in the end (delta: -164.8 MB). Peak memory consumption was 390.4 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,170 INFO L168 Benchmark]: BuchiAutomizer took 5179.36 ms. Allocated memory was 836.2 MB in the beginning and 918.0 MB in the end (delta: 81.8 MB). Free memory was 768.8 MB in the beginning and 693.5 MB in the end (delta: 75.3 MB). Peak memory consumption was 157.1 MB. Max. memory is 50.3 GB. 45.50/19.77 [2019-03-28 12:35:00,174 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 45.50/19.77 --- Results --- 45.50/19.77 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 45.50/19.77 - StatisticsResult: Initial Icfg 45.50/19.77 28 locations, 34 edges 45.50/19.77 - StatisticsResult: Encoded RCFG 45.50/19.77 20 locations, 36 edges 45.50/19.77 * Results from de.uni_freiburg.informatik.ultimate.core: 45.50/19.77 - StatisticsResult: Toolchain Benchmarks 45.50/19.77 Benchmark results are: 45.50/19.77 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 45.50/19.77 * CACSL2BoogieTranslator took 325.45 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 566.0 MB in the beginning and 641.8 MB in the end (delta: -75.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 50.3 GB. 45.50/19.77 * Boogie Procedure Inliner took 44.81 ms. Allocated memory is still 674.2 MB. Free memory was 641.8 MB in the beginning and 637.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 45.50/19.77 * Boogie Preprocessor took 29.40 ms. Allocated memory is still 674.2 MB. Free memory was 637.9 MB in the beginning and 635.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 45.50/19.77 * RCFGBuilder took 329.03 ms. Allocated memory is still 674.2 MB. Free memory was 635.8 MB in the beginning and 612.6 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 45.50/19.77 * BlockEncodingV2 took 120.02 ms. Allocated memory is still 674.2 MB. Free memory was 612.6 MB in the beginning and 603.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 45.50/19.77 * TraceAbstraction took 8759.99 ms. Allocated memory was 674.2 MB in the beginning and 836.2 MB in the end (delta: 162.0 MB). Free memory was 603.9 MB in the beginning and 768.8 MB in the end (delta: -164.8 MB). Peak memory consumption was 390.4 MB. Max. memory is 50.3 GB. 45.50/19.77 * BuchiAutomizer took 5179.36 ms. Allocated memory was 836.2 MB in the beginning and 918.0 MB in the end (delta: 81.8 MB). Free memory was 768.8 MB in the beginning and 693.5 MB in the end (delta: 75.3 MB). Peak memory consumption was 157.1 MB. Max. memory is 50.3 GB. 45.50/19.77 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #memory_int 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 - GenericResult: Unfinished Backtranslation 45.50/19.77 unknown boogie variable #length 45.50/19.77 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 45.50/19.77 - PositiveResult [Line: 14]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 14]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 14]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 39]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 21]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 21]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 39]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - PositiveResult [Line: 14]: pointer dereference always succeeds 45.50/19.77 For all program executions holds that pointer dereference always succeeds at this location 45.50/19.77 - AllSpecificationsHoldResult: All specifications hold 45.50/19.77 8 specifications checked. All of them hold 45.50/19.77 - InvariantResult [Line: 12]: Loop Invariant 45.50/19.77 [2019-03-28 12:35:00,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:35:00,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:35:00,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:35:00,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:35:00,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:35:00,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 45.50/19.77 [2019-03-28 12:35:00,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 45.50/19.77 [2019-03-28 12:35:00,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 Derived loop invariant: (((((((((((((nondetString == 0 && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && n <= 0) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && \valid[nondetString] == 1) && 1 <= n) && 1 == \valid[dst]) && n <= 1) && 1 == \valid[src]) || (((((((((((((((((!(nondetString == nondetArea) && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && 0 == dst) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && n <= unknown-#length-unknown[dst]) && nondetString == 0) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 1 <= unknown-#length-unknown[dst]) && \valid[nondetString] == 1) && 1 == \valid[dst]) && src == 0) && !(src == dst)) && 1 == \valid[src])) || (((((((((((((((((1 <= dst && !(nondetString == nondetArea)) && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && src + 1 <= unknown-#length-unknown[src]) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 0 <= n) && 1 <= n) && nondetString == 0) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && \valid[nondetString] == 1) && 1 == \valid[dst]) && n + dst <= unknown-#length-unknown[dst]) && !(src == dst)) && 1 <= src) && 1 == \valid[src])) || (((\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && src <= ULTIMATE.start_main_~nondetString~0.offset) && n <= unknown-#length-unknown[dst]) && (((((((((((((((1 <= length && n == unknown-#length-unknown[nondetArea]) && 0 == dst) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && n <= 1) && nondetString == 0) && \valid[nondetString] == 1) && 1 == \valid[dst]) && src == 0) && n <= 1) && 1 == \valid[src]) || ((((((((((((((n == unknown-#length-unknown[nondetArea] && 0 == dst) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 0 == unknown-#memory_int-unknown[src][src]) && 1 <= n) && length + nondetString == 1) && nondetString == 0) && 1 <= unknown-#length-unknown[dst]) && \valid[nondetString] == 1) && 1 == \valid[dst]) && src == 0) && 1 == \valid[src]))) 45.50/19.77 - InvariantResult [Line: 20]: Loop Invariant 45.50/19.77 [2019-03-28 12:35:00,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 [2019-03-28 12:35:00,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 45.50/19.77 Derived loop invariant: (((((((n2 <= 0 && n <= 0) && (((((((nondetString == 0 && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && \valid[nondetArea] == 1) && \valid[nondetString] == 1) && 1 <= n) && 1 == \valid[dst]) && 1 == \valid[src]) && length == unknown-#length-unknown[nondetString]) && 0 <= n) && 0 <= n2) && n <= 1) && 1 <= src) || (((((((((1 <= dst && 1 <= us) && (((((((nondetString == 0 && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && \valid[nondetArea] == 1) && \valid[nondetString] == 1) && 1 <= n) && 1 == \valid[dst]) && 1 == \valid[src]) && length == unknown-#length-unknown[nondetString]) && 0 <= n) && \valid[us] == 1) && n + dst <= unknown-#length-unknown[dst]) && 1 <= src) && 0 <= n2) && us + n2 <= unknown-#length-unknown[us]) 45.50/19.77 - StatisticsResult: Ultimate Automizer benchmark data 45.50/19.77 CFG has 1 procedures, 20 locations, 8 error locations. SAFE Result, 8.6s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 736 SDslu, 903 SDs, 0 SdLazy, 1971 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=12, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 515 HoareAnnotationTreeSize, 2 FomulaSimplifications, 679 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 3073 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 281 ConstructedInterpolants, 2 QuantifiedInterpolants, 18968 SizeOfPredicates, 70 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 11/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 45.50/19.77 - StatisticsResult: Constructed decomposition of program 45.50/19.77 Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(n * sizeof(char))] + -1 * src and consists of 9 locations. One nondeterministic module has affine ranking function -1 * us + unknown-#length-unknown[dst] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. 45.50/19.77 - StatisticsResult: Timing statistics 45.50/19.77 BüchiAutomizer plugin needed 5.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. 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 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 333 SDslu, 160 SDs, 0 SdLazy, 287 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf100 lsp96 ukn87 mio100 lsp51 div100 bol100 ite100 ukn100 eq194 hnf88 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 45.50/19.77 - TerminationAnalysisResult: Termination proven 45.50/19.77 Buchi Automizer proved that your program is terminating 45.50/19.77 RESULT: Ultimate proved your program to be correct! 45.50/19.77 !SESSION 2019-03-28 12:34:41.742 ----------------------------------------------- 45.50/19.77 eclipse.buildId=unknown 45.50/19.77 java.version=1.8.0_181 45.50/19.77 java.vendor=Oracle Corporation 45.50/19.77 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 45.50/19.77 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 45.50/19.77 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 45.50/19.77 45.50/19.77 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:35:00.438 45.50/19.77 !MESSAGE The workspace will exit with unsaved changes in this session. 45.50/19.77 Received shutdown request... 45.50/19.77 Ultimate: 45.50/19.77 GTK+ Version Check 45.50/19.77 EOF