36.98/20.75 YES 36.98/20.75 36.98/20.75 Ultimate: Cannot open display: 36.98/20.75 This is Ultimate 0.1.24-8dc7c08-m 36.98/20.75 [2019-03-28 12:39:15,581 INFO L170 SettingsManager]: Resetting all preferences to default values... 36.98/20.75 [2019-03-28 12:39:15,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 36.98/20.75 [2019-03-28 12:39:15,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 36.98/20.75 [2019-03-28 12:39:15,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 36.98/20.75 [2019-03-28 12:39:15,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 36.98/20.75 [2019-03-28 12:39:15,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 36.98/20.75 [2019-03-28 12:39:15,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 36.98/20.75 [2019-03-28 12:39:15,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 36.98/20.75 [2019-03-28 12:39:15,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 36.98/20.75 [2019-03-28 12:39:15,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 36.98/20.75 [2019-03-28 12:39:15,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 36.98/20.75 [2019-03-28 12:39:15,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 36.98/20.75 [2019-03-28 12:39:15,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 36.98/20.75 [2019-03-28 12:39:15,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 36.98/20.75 [2019-03-28 12:39:15,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 36.98/20.75 [2019-03-28 12:39:15,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 36.98/20.75 [2019-03-28 12:39:15,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 36.98/20.75 [2019-03-28 12:39:15,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 36.98/20.75 [2019-03-28 12:39:15,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 36.98/20.75 [2019-03-28 12:39:15,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,617 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 36.98/20.75 [2019-03-28 12:39:15,617 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 36.98/20.75 [2019-03-28 12:39:15,618 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 36.98/20.75 [2019-03-28 12:39:15,619 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,619 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 36.98/20.75 [2019-03-28 12:39:15,620 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 36.98/20.75 [2019-03-28 12:39:15,620 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 36.98/20.75 [2019-03-28 12:39:15,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 36.98/20.75 [2019-03-28 12:39:15,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 36.98/20.75 [2019-03-28 12:39:15,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 36.98/20.75 [2019-03-28 12:39:15,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 36.98/20.75 [2019-03-28 12:39:15,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 36.98/20.75 [2019-03-28 12:39:15,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 36.98/20.75 [2019-03-28 12:39:15,625 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 36.98/20.75 [2019-03-28 12:39:15,639 INFO L110 SettingsManager]: Loading preferences was successful 36.98/20.75 [2019-03-28 12:39:15,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 36.98/20.75 [2019-03-28 12:39:15,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 36.98/20.75 [2019-03-28 12:39:15,641 INFO L133 SettingsManager]: * Rewrite not-equals=true 36.98/20.75 [2019-03-28 12:39:15,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 36.98/20.75 [2019-03-28 12:39:15,641 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 36.98/20.75 [2019-03-28 12:39:15,641 INFO L133 SettingsManager]: * Use SBE=true 36.98/20.75 [2019-03-28 12:39:15,642 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 36.98/20.75 [2019-03-28 12:39:15,642 INFO L133 SettingsManager]: * Use old map elimination=false 36.98/20.75 [2019-03-28 12:39:15,642 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 36.98/20.75 [2019-03-28 12:39:15,642 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 36.98/20.75 [2019-03-28 12:39:15,642 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 36.98/20.75 [2019-03-28 12:39:15,643 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 36.98/20.75 [2019-03-28 12:39:15,643 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 36.98/20.75 [2019-03-28 12:39:15,643 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 36.98/20.75 [2019-03-28 12:39:15,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 36.98/20.75 [2019-03-28 12:39:15,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 36.98/20.75 [2019-03-28 12:39:15,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE 36.98/20.75 [2019-03-28 12:39:15,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 36.98/20.75 [2019-03-28 12:39:15,644 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 36.98/20.75 [2019-03-28 12:39:15,644 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 36.98/20.75 [2019-03-28 12:39:15,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 36.98/20.75 [2019-03-28 12:39:15,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 36.98/20.75 [2019-03-28 12:39:15,645 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 36.98/20.75 [2019-03-28 12:39:15,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 36.98/20.75 [2019-03-28 12:39:15,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 36.98/20.75 [2019-03-28 12:39:15,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 36.98/20.75 [2019-03-28 12:39:15,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 36.98/20.75 [2019-03-28 12:39:15,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 36.98/20.75 [2019-03-28 12:39:15,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 36.98/20.75 [2019-03-28 12:39:15,684 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 36.98/20.75 [2019-03-28 12:39:15,688 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 36.98/20.75 [2019-03-28 12:39:15,689 INFO L271 PluginConnector]: Initializing CDTParser... 36.98/20.75 [2019-03-28 12:39:15,689 INFO L276 PluginConnector]: CDTParser initialized 36.98/20.75 [2019-03-28 12:39:15,690 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 36.98/20.75 [2019-03-28 12:39:15,749 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/331eebe6fe6845c0aee202a6bf7bb39f/FLAGeb1c76c23 36.98/20.75 [2019-03-28 12:39:16,102 INFO L307 CDTParser]: Found 1 translation units. 36.98/20.75 [2019-03-28 12:39:16,103 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 36.98/20.75 [2019-03-28 12:39:16,103 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 36.98/20.75 [2019-03-28 12:39:16,110 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/331eebe6fe6845c0aee202a6bf7bb39f/FLAGeb1c76c23 36.98/20.75 [2019-03-28 12:39:16,495 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/331eebe6fe6845c0aee202a6bf7bb39f 36.98/20.75 [2019-03-28 12:39:16,507 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 36.98/20.75 [2019-03-28 12:39:16,508 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 36.98/20.75 [2019-03-28 12:39:16,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 36.98/20.75 [2019-03-28 12:39:16,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 36.98/20.75 [2019-03-28 12:39:16,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 36.98/20.75 [2019-03-28 12:39:16,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c026ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:16,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 36.98/20.75 [2019-03-28 12:39:16,543 INFO L176 MainTranslator]: Built tables and reachable declarations 36.98/20.75 [2019-03-28 12:39:16,714 INFO L206 PostProcessor]: Analyzing one entry point: main 36.98/20.75 [2019-03-28 12:39:16,727 INFO L191 MainTranslator]: Completed pre-run 36.98/20.75 [2019-03-28 12:39:16,807 INFO L206 PostProcessor]: Analyzing one entry point: main 36.98/20.75 [2019-03-28 12:39:16,824 INFO L195 MainTranslator]: Completed translation 36.98/20.75 [2019-03-28 12:39:16,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16 WrapperNode 36.98/20.75 [2019-03-28 12:39:16,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 36.98/20.75 [2019-03-28 12:39:16,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 36.98/20.75 [2019-03-28 12:39:16,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 36.98/20.75 [2019-03-28 12:39:16,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 36.98/20.75 [2019-03-28 12:39:16,836 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:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,846 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:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 36.98/20.75 [2019-03-28 12:39:16,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 36.98/20.75 [2019-03-28 12:39:16,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 36.98/20.75 [2019-03-28 12:39:16,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized 36.98/20.75 [2019-03-28 12:39:16,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 [2019-03-28 12:39:16,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 36.98/20.75 [2019-03-28 12:39:16,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 36.98/20.75 [2019-03-28 12:39:16,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... 36.98/20.75 [2019-03-28 12:39:16,898 INFO L276 PluginConnector]: RCFGBuilder initialized 36.98/20.75 [2019-03-28 12:39:16,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (1/1) ... 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 36.98/20.75 [2019-03-28 12:39:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 36.98/20.75 [2019-03-28 12:39:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 36.98/20.75 [2019-03-28 12:39:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 36.98/20.75 [2019-03-28 12:39:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 36.98/20.75 [2019-03-28 12:39:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 36.98/20.75 [2019-03-28 12:39:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 36.98/20.75 [2019-03-28 12:39:17,182 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 36.98/20.75 [2019-03-28 12:39:17,182 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 36.98/20.75 [2019-03-28 12:39:17,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:17 BoogieIcfgContainer 36.98/20.75 [2019-03-28 12:39:17,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 36.98/20.75 [2019-03-28 12:39:17,185 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 36.98/20.75 [2019-03-28 12:39:17,185 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 36.98/20.75 [2019-03-28 12:39:17,187 INFO L276 PluginConnector]: BlockEncodingV2 initialized 36.98/20.75 [2019-03-28 12:39:17,188 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:17" (1/1) ... 36.98/20.75 [2019-03-28 12:39:17,205 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges 36.98/20.75 [2019-03-28 12:39:17,207 INFO L258 BlockEncoder]: Using Remove infeasible edges 36.98/20.75 [2019-03-28 12:39:17,207 INFO L263 BlockEncoder]: Using Maximize final states 36.98/20.75 [2019-03-28 12:39:17,208 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 36.98/20.75 [2019-03-28 12:39:17,208 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 36.98/20.75 [2019-03-28 12:39:17,210 INFO L296 BlockEncoder]: Using Remove sink states 36.98/20.75 [2019-03-28 12:39:17,211 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 36.98/20.75 [2019-03-28 12:39:17,211 INFO L179 BlockEncoder]: Using Rewrite not-equals 36.98/20.75 [2019-03-28 12:39:17,231 INFO L185 BlockEncoder]: Using Use SBE 36.98/20.75 [2019-03-28 12:39:17,257 INFO L200 BlockEncoder]: SBE split 8 edges 36.98/20.75 [2019-03-28 12:39:17,262 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 36.98/20.75 [2019-03-28 12:39:17,264 INFO L71 MaximizeFinalStates]: 0 new accepting states 36.98/20.75 [2019-03-28 12:39:17,296 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 36.98/20.75 [2019-03-28 12:39:17,299 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 36.98/20.75 [2019-03-28 12:39:17,300 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 36.98/20.75 [2019-03-28 12:39:17,301 INFO L71 MaximizeFinalStates]: 0 new accepting states 36.98/20.75 [2019-03-28 12:39:17,301 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 36.98/20.75 [2019-03-28 12:39:17,302 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 36.98/20.75 [2019-03-28 12:39:17,302 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges 36.98/20.75 [2019-03-28 12:39:17,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:17 BasicIcfg 36.98/20.75 [2019-03-28 12:39:17,303 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 36.98/20.75 [2019-03-28 12:39:17,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 36.98/20.75 [2019-03-28 12:39:17,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... 36.98/20.75 [2019-03-28 12:39:17,307 INFO L276 PluginConnector]: TraceAbstraction initialized 36.98/20.75 [2019-03-28 12:39:17,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:39:16" (1/4) ... 36.98/20.75 [2019-03-28 12:39:17,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567e929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:17, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:17,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (2/4) ... 36.98/20.75 [2019-03-28 12:39:17,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567e929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:17, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:17,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:17" (3/4) ... 36.98/20.75 [2019-03-28 12:39:17,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567e929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:17, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:17,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:17" (4/4) ... 36.98/20.75 [2019-03-28 12:39:17,311 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 36.98/20.75 [2019-03-28 12:39:17,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 36.98/20.75 [2019-03-28 12:39:17,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 36.98/20.75 [2019-03-28 12:39:17,347 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 36.98/20.75 [2019-03-28 12:39:17,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation 36.98/20.75 [2019-03-28 12:39:17,378 INFO L382 AbstractCegarLoop]: Interprodecural is true 36.98/20.75 [2019-03-28 12:39:17,378 INFO L383 AbstractCegarLoop]: Hoare is true 36.98/20.75 [2019-03-28 12:39:17,378 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 36.98/20.75 [2019-03-28 12:39:17,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 36.98/20.75 [2019-03-28 12:39:17,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 36.98/20.75 [2019-03-28 12:39:17,378 INFO L387 AbstractCegarLoop]: Difference is false 36.98/20.75 [2019-03-28 12:39:17,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 36.98/20.75 [2019-03-28 12:39:17,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 36.98/20.75 [2019-03-28 12:39:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. 36.98/20.75 [2019-03-28 12:39:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 36.98/20.75 [2019-03-28 12:39:17,400 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:17,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:17,401 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:17,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash 125972526, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:17,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:17,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:17,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:17,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 36.98/20.75 [2019-03-28 12:39:17,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 36.98/20.75 [2019-03-28 12:39:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 36.98/20.75 [2019-03-28 12:39:17,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.98/20.75 [2019-03-28 12:39:17,598 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. 36.98/20.75 [2019-03-28 12:39:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:17,675 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. 36.98/20.75 [2019-03-28 12:39:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 36.98/20.75 [2019-03-28 12:39:17,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 36.98/20.75 [2019-03-28 12:39:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:17,690 INFO L225 Difference]: With dead ends: 15 36.98/20.75 [2019-03-28 12:39:17,690 INFO L226 Difference]: Without dead ends: 14 36.98/20.75 [2019-03-28 12:39:17,694 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 36.98/20.75 [2019-03-28 12:39:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 36.98/20.75 [2019-03-28 12:39:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 36.98/20.75 [2019-03-28 12:39:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.98/20.75 [2019-03-28 12:39:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:17,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 36.98/20.75 [2019-03-28 12:39:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:17,732 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:17,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 36.98/20.75 [2019-03-28 12:39:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 36.98/20.75 [2019-03-28 12:39:17,733 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:17,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:17,734 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 125972528, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:17,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:17,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:17,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 36.98/20.75 [2019-03-28 12:39:17,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 36.98/20.75 [2019-03-28 12:39:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 36.98/20.75 [2019-03-28 12:39:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 36.98/20.75 [2019-03-28 12:39:17,781 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. 36.98/20.75 [2019-03-28 12:39:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:17,833 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 36.98/20.75 [2019-03-28 12:39:17,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 36.98/20.75 [2019-03-28 12:39:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:17,835 INFO L225 Difference]: With dead ends: 15 36.98/20.75 [2019-03-28 12:39:17,835 INFO L226 Difference]: Without dead ends: 14 36.98/20.75 [2019-03-28 12:39:17,836 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 36.98/20.75 [2019-03-28 12:39:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 36.98/20.75 [2019-03-28 12:39:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 36.98/20.75 [2019-03-28 12:39:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.98/20.75 [2019-03-28 12:39:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. 36.98/20.75 [2019-03-28 12:39:17,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 36.98/20.75 [2019-03-28 12:39:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:17,840 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. 36.98/20.75 [2019-03-28 12:39:17,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 36.98/20.75 [2019-03-28 12:39:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. 36.98/20.75 [2019-03-28 12:39:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 36.98/20.75 [2019-03-28 12:39:17,841 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:17,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:17,841 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 125972529, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:17,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:17,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:17,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 36.98/20.75 [2019-03-28 12:39:17,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 36.98/20.75 [2019-03-28 12:39:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 36.98/20.75 [2019-03-28 12:39:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.98/20.75 [2019-03-28 12:39:17,878 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. 36.98/20.75 [2019-03-28 12:39:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:17,940 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. 36.98/20.75 [2019-03-28 12:39:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 36.98/20.75 [2019-03-28 12:39:17,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 36.98/20.75 [2019-03-28 12:39:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:17,942 INFO L225 Difference]: With dead ends: 14 36.98/20.75 [2019-03-28 12:39:17,942 INFO L226 Difference]: Without dead ends: 13 36.98/20.75 [2019-03-28 12:39:17,942 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 36.98/20.75 [2019-03-28 12:39:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 36.98/20.75 [2019-03-28 12:39:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:17,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 36.98/20.75 [2019-03-28 12:39:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:17,946 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:17,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 36.98/20.75 [2019-03-28 12:39:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 36.98/20.75 [2019-03-28 12:39:17,947 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:17,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:17,947 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash -389818398, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:17,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:17,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:18,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 36.98/20.75 [2019-03-28 12:39:18,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 36.98/20.75 [2019-03-28 12:39:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 36.98/20.75 [2019-03-28 12:39:18,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 36.98/20.75 [2019-03-28 12:39:18,010 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. 36.98/20.75 [2019-03-28 12:39:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:18,121 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 36.98/20.75 [2019-03-28 12:39:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 36.98/20.75 [2019-03-28 12:39:18,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 36.98/20.75 [2019-03-28 12:39:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:18,122 INFO L225 Difference]: With dead ends: 21 36.98/20.75 [2019-03-28 12:39:18,122 INFO L226 Difference]: Without dead ends: 20 36.98/20.75 [2019-03-28 12:39:18,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 36.98/20.75 [2019-03-28 12:39:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 36.98/20.75 [2019-03-28 12:39:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. 36.98/20.75 [2019-03-28 12:39:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.98/20.75 [2019-03-28 12:39:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:18,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 6 36.98/20.75 [2019-03-28 12:39:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:18,128 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:18,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 36.98/20.75 [2019-03-28 12:39:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 36.98/20.75 [2019-03-28 12:39:18,129 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:18,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:18,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -389818401, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:18,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:18,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 36.98/20.75 [2019-03-28 12:39:18,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 36.98/20.75 [2019-03-28 12:39:18,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 36.98/20.75 [2019-03-28 12:39:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.98/20.75 [2019-03-28 12:39:18,161 INFO L87 Difference]: Start difference. First operand 14 states and 26 transitions. Second operand 3 states. 36.98/20.75 [2019-03-28 12:39:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:18,204 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:18,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 36.98/20.75 [2019-03-28 12:39:18,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 36.98/20.75 [2019-03-28 12:39:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:18,206 INFO L225 Difference]: With dead ends: 14 36.98/20.75 [2019-03-28 12:39:18,206 INFO L226 Difference]: Without dead ends: 13 36.98/20.75 [2019-03-28 12:39:18,206 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 36.98/20.75 [2019-03-28 12:39:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 36.98/20.75 [2019-03-28 12:39:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 6 36.98/20.75 [2019-03-28 12:39:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:18,210 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 36.98/20.75 [2019-03-28 12:39:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 36.98/20.75 [2019-03-28 12:39:18,211 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:18,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:18,211 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:18,211 INFO L82 PathProgramCache]: Analyzing trace with hash 800530717, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:18,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:18,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:18,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 36.98/20.75 [2019-03-28 12:39:18,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 36.98/20.75 [2019-03-28 12:39:18,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 36.98/20.75 [2019-03-28 12:39:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 36.98/20.75 [2019-03-28 12:39:18,265 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 4 states. 36.98/20.75 [2019-03-28 12:39:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:18,317 INFO L93 Difference]: Finished difference Result 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 36.98/20.75 [2019-03-28 12:39:18,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 36.98/20.75 [2019-03-28 12:39:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:18,319 INFO L225 Difference]: With dead ends: 13 36.98/20.75 [2019-03-28 12:39:18,319 INFO L226 Difference]: Without dead ends: 12 36.98/20.75 [2019-03-28 12:39:18,319 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 36.98/20.75 [2019-03-28 12:39:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 36.98/20.75 [2019-03-28 12:39:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 36.98/20.75 [2019-03-28 12:39:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 36.98/20.75 [2019-03-28 12:39:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. 36.98/20.75 [2019-03-28 12:39:18,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 7 36.98/20.75 [2019-03-28 12:39:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:18,323 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. 36.98/20.75 [2019-03-28 12:39:18,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 36.98/20.75 [2019-03-28 12:39:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. 36.98/20.75 [2019-03-28 12:39:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 36.98/20.75 [2019-03-28 12:39:18,324 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:18,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:18,324 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash 800530719, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:18,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:18,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:18,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 36.98/20.75 [2019-03-28 12:39:18,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 36.98/20.75 [2019-03-28 12:39:18,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 36.98/20.75 [2019-03-28 12:39:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 36.98/20.75 [2019-03-28 12:39:18,362 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. 36.98/20.75 [2019-03-28 12:39:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:18,419 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 36.98/20.75 [2019-03-28 12:39:18,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 36.98/20.75 [2019-03-28 12:39:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:18,420 INFO L225 Difference]: With dead ends: 17 36.98/20.75 [2019-03-28 12:39:18,421 INFO L226 Difference]: Without dead ends: 16 36.98/20.75 [2019-03-28 12:39:18,421 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 36.98/20.75 [2019-03-28 12:39:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 36.98/20.75 [2019-03-28 12:39:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. 36.98/20.75 [2019-03-28 12:39:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 7 36.98/20.75 [2019-03-28 12:39:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:18,426 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 36.98/20.75 [2019-03-28 12:39:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 36.98/20.75 [2019-03-28 12:39:18,428 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:18,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:18,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 800530720, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:18,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:18,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 36.98/20.75 [2019-03-28 12:39:18,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 36.98/20.75 [2019-03-28 12:39:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 36.98/20.75 [2019-03-28 12:39:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 36.98/20.75 [2019-03-28 12:39:18,495 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 5 states. 36.98/20.75 [2019-03-28 12:39:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:18,571 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:18,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 36.98/20.75 [2019-03-28 12:39:18,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 36.98/20.75 [2019-03-28 12:39:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:18,573 INFO L225 Difference]: With dead ends: 16 36.98/20.75 [2019-03-28 12:39:18,573 INFO L226 Difference]: Without dead ends: 15 36.98/20.75 [2019-03-28 12:39:18,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 36.98/20.75 [2019-03-28 12:39:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 36.98/20.75 [2019-03-28 12:39:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. 36.98/20.75 [2019-03-28 12:39:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. 36.98/20.75 [2019-03-28 12:39:18,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 7 36.98/20.75 [2019-03-28 12:39:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:18,577 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. 36.98/20.75 [2019-03-28 12:39:18,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 36.98/20.75 [2019-03-28 12:39:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. 36.98/20.75 [2019-03-28 12:39:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 36.98/20.75 [2019-03-28 12:39:18,578 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:18,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:18,579 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1344015987, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:18,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:18,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:18,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 36.98/20.75 [2019-03-28 12:39:18,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 36.98/20.75 [2019-03-28 12:39:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 36.98/20.75 [2019-03-28 12:39:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 36.98/20.75 [2019-03-28 12:39:18,695 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 7 states. 36.98/20.75 [2019-03-28 12:39:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:18,845 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. 36.98/20.75 [2019-03-28 12:39:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 36.98/20.75 [2019-03-28 12:39:18,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 36.98/20.75 [2019-03-28 12:39:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:18,848 INFO L225 Difference]: With dead ends: 25 36.98/20.75 [2019-03-28 12:39:18,848 INFO L226 Difference]: Without dead ends: 13 36.98/20.75 [2019-03-28 12:39:18,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 36.98/20.75 [2019-03-28 12:39:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 36.98/20.75 [2019-03-28 12:39:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.98/20.75 [2019-03-28 12:39:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. 36.98/20.75 [2019-03-28 12:39:18,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 36.98/20.75 [2019-03-28 12:39:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:18,852 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. 36.98/20.75 [2019-03-28 12:39:18,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 36.98/20.75 [2019-03-28 12:39:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. 36.98/20.75 [2019-03-28 12:39:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 36.98/20.75 [2019-03-28 12:39:18,853 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:18,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:18,853 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1823555216, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:18,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:18,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:18,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:18,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.98/20.75 [2019-03-28 12:39:18,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.98/20.75 [2019-03-28 12:39:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:19,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core 36.98/20.75 [2019-03-28 12:39:19,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.75 [2019-03-28 12:39:19,099 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 36.98/20.75 [2019-03-28 12:39:19,099 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:19,115 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:19,116 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:19,116 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 36.98/20.75 [2019-03-28 12:39:19,165 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:19,165 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 36.98/20.75 [2019-03-28 12:39:19,169 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 36.98/20.75 [2019-03-28 12:39:19,180 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:19,186 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 36.98/20.75 [2019-03-28 12:39:19,187 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 36.98/20.75 [2019-03-28 12:39:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:19,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 36.98/20.75 [2019-03-28 12:39:19,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 36.98/20.75 [2019-03-28 12:39:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 36.98/20.75 [2019-03-28 12:39:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 36.98/20.75 [2019-03-28 12:39:19,269 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 11 states. 36.98/20.75 [2019-03-28 12:39:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:19,614 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 36.98/20.75 [2019-03-28 12:39:19,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 36.98/20.75 [2019-03-28 12:39:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:19,615 INFO L225 Difference]: With dead ends: 18 36.98/20.75 [2019-03-28 12:39:19,615 INFO L226 Difference]: Without dead ends: 17 36.98/20.75 [2019-03-28 12:39:19,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 36.98/20.75 [2019-03-28 12:39:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 36.98/20.75 [2019-03-28 12:39:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. 36.98/20.75 [2019-03-28 12:39:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 36.98/20.75 [2019-03-28 12:39:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:19,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 10 36.98/20.75 [2019-03-28 12:39:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:19,620 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:19,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 36.98/20.75 [2019-03-28 12:39:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 36.98/20.75 [2019-03-28 12:39:19,621 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:19,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:19,621 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1823555215, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:19,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:19,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:19,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.98/20.75 [2019-03-28 12:39:19,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.98/20.75 [2019-03-28 12:39:19,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:19,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core 36.98/20.75 [2019-03-28 12:39:19,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.75 [2019-03-28 12:39:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:19,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:19,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 36.98/20.75 [2019-03-28 12:39:19,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 36.98/20.75 [2019-03-28 12:39:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 36.98/20.75 [2019-03-28 12:39:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 36.98/20.75 [2019-03-28 12:39:19,728 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. Second operand 6 states. 36.98/20.75 [2019-03-28 12:39:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:19,790 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. 36.98/20.75 [2019-03-28 12:39:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 36.98/20.75 [2019-03-28 12:39:19,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 36.98/20.75 [2019-03-28 12:39:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:19,791 INFO L225 Difference]: With dead ends: 17 36.98/20.75 [2019-03-28 12:39:19,792 INFO L226 Difference]: Without dead ends: 16 36.98/20.75 [2019-03-28 12:39:19,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 36.98/20.75 [2019-03-28 12:39:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 36.98/20.75 [2019-03-28 12:39:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 36.98/20.75 [2019-03-28 12:39:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 36.98/20.75 [2019-03-28 12:39:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:19,796 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 36.98/20.75 [2019-03-28 12:39:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:19,796 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:19,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 36.98/20.75 [2019-03-28 12:39:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 36.98/20.75 [2019-03-28 12:39:19,797 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:19,797 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:19,797 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:19,797 INFO L82 PathProgramCache]: Analyzing trace with hash 695636017, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:19,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:19,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:19,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.98/20.75 [2019-03-28 12:39:19,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.98/20.75 [2019-03-28 12:39:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:19,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core 36.98/20.75 [2019-03-28 12:39:19,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.75 [2019-03-28 12:39:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:19,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 36.98/20.75 [2019-03-28 12:39:19,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 36.98/20.75 [2019-03-28 12:39:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 36.98/20.75 [2019-03-28 12:39:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 36.98/20.75 [2019-03-28 12:39:19,910 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 6 states. 36.98/20.75 [2019-03-28 12:39:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:19,960 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. 36.98/20.75 [2019-03-28 12:39:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 36.98/20.75 [2019-03-28 12:39:19,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 36.98/20.75 [2019-03-28 12:39:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:19,961 INFO L225 Difference]: With dead ends: 17 36.98/20.75 [2019-03-28 12:39:19,961 INFO L226 Difference]: Without dead ends: 16 36.98/20.75 [2019-03-28 12:39:19,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 36.98/20.75 [2019-03-28 12:39:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 36.98/20.75 [2019-03-28 12:39:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 36.98/20.75 [2019-03-28 12:39:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 36.98/20.75 [2019-03-28 12:39:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:19,965 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 36.98/20.75 [2019-03-28 12:39:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:19,966 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:19,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 36.98/20.75 [2019-03-28 12:39:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. 36.98/20.75 [2019-03-28 12:39:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 36.98/20.75 [2019-03-28 12:39:19,966 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:19,967 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:19,967 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 695636018, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:19,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:19,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:20,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.98/20.75 [2019-03-28 12:39:20,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.98/20.75 [2019-03-28 12:39:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:20,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core 36.98/20.75 [2019-03-28 12:39:20,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.75 [2019-03-28 12:39:20,097 INFO L189 IndexEqualityManager]: detected not equals via solver 36.98/20.75 [2019-03-28 12:39:20,100 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 36.98/20.75 [2019-03-28 12:39:20,100 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:20,111 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:20,119 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 36.98/20.75 [2019-03-28 12:39:20,120 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:20,129 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:20,130 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:20,130 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 36.98/20.75 [2019-03-28 12:39:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 36.98/20.75 [2019-03-28 12:39:20,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 36.98/20.75 [2019-03-28 12:39:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 36.98/20.75 [2019-03-28 12:39:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 36.98/20.75 [2019-03-28 12:39:20,255 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 11 states. 36.98/20.75 [2019-03-28 12:39:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:28,482 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. 36.98/20.75 [2019-03-28 12:39:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 36.98/20.75 [2019-03-28 12:39:28,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 36.98/20.75 [2019-03-28 12:39:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:28,483 INFO L225 Difference]: With dead ends: 19 36.98/20.75 [2019-03-28 12:39:28,483 INFO L226 Difference]: Without dead ends: 18 36.98/20.75 [2019-03-28 12:39:28,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 36.98/20.75 [2019-03-28 12:39:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 36.98/20.75 [2019-03-28 12:39:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. 36.98/20.75 [2019-03-28 12:39:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 36.98/20.75 [2019-03-28 12:39:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. 36.98/20.75 [2019-03-28 12:39:28,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 11 36.98/20.75 [2019-03-28 12:39:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:28,488 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. 36.98/20.75 [2019-03-28 12:39:28,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 36.98/20.75 [2019-03-28 12:39:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. 36.98/20.75 [2019-03-28 12:39:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 36.98/20.75 [2019-03-28 12:39:28,490 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:28,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:28,490 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 474108219, now seen corresponding path program 2 times 36.98/20.75 [2019-03-28 12:39:28,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:28,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.98/20.75 [2019-03-28 12:39:28,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.98/20.75 [2019-03-28 12:39:28,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 36.98/20.75 [2019-03-28 12:39:28,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 36.98/20.75 [2019-03-28 12:39:28,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:28,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core 36.98/20.75 [2019-03-28 12:39:28,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.75 [2019-03-28 12:39:28,754 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 36.98/20.75 [2019-03-28 12:39:28,754 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,762 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:28,767 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 36.98/20.75 [2019-03-28 12:39:28,767 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,774 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:28,775 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,775 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 36.98/20.75 [2019-03-28 12:39:28,796 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 16 treesize of output 12 36.98/20.75 [2019-03-28 12:39:28,797 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,806 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:28,807 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. 36.98/20.75 [2019-03-28 12:39:28,807 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 36.98/20.75 [2019-03-28 12:39:28,840 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 24 treesize of output 23 36.98/20.75 [2019-03-28 12:39:28,841 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,850 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:28,851 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,851 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:23 36.98/20.75 [2019-03-28 12:39:28,892 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:28,892 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 36.98/20.75 [2019-03-28 12:39:28,894 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,904 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:28,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:28,907 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 36.98/20.75 [2019-03-28 12:39:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 36.98/20.75 [2019-03-28 12:39:28,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 36.98/20.75 [2019-03-28 12:39:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 36.98/20.75 [2019-03-28 12:39:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 36.98/20.75 [2019-03-28 12:39:28,979 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 12 states. 36.98/20.75 [2019-03-28 12:39:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:29,685 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. 36.98/20.75 [2019-03-28 12:39:29,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 36.98/20.75 [2019-03-28 12:39:29,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 36.98/20.75 [2019-03-28 12:39:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:29,686 INFO L225 Difference]: With dead ends: 22 36.98/20.75 [2019-03-28 12:39:29,686 INFO L226 Difference]: Without dead ends: 21 36.98/20.75 [2019-03-28 12:39:29,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 36.98/20.75 [2019-03-28 12:39:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 36.98/20.75 [2019-03-28 12:39:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. 36.98/20.75 [2019-03-28 12:39:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 36.98/20.75 [2019-03-28 12:39:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:29,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 14 36.98/20.75 [2019-03-28 12:39:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:29,692 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:29,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 36.98/20.75 [2019-03-28 12:39:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 36.98/20.75 [2019-03-28 12:39:29,693 INFO L394 BasicCegarLoop]: Found error trace 36.98/20.75 [2019-03-28 12:39:29,693 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:29,693 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 36.98/20.75 [2019-03-28 12:39:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1570498009, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:29,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:29,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:29,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:29,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.98/20.75 [2019-03-28 12:39:29,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.98/20.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.98/20.75 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.98/20.75 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.98/20.75 [2019-03-28 12:39:29,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.75 [2019-03-28 12:39:29,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 37 conjunts are in the unsatisfiable core 36.98/20.75 [2019-03-28 12:39:29,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.75 [2019-03-28 12:39:29,888 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 36.98/20.75 [2019-03-28 12:39:29,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,894 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,897 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 36.98/20.75 [2019-03-28 12:39:29,897 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,903 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,904 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,904 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 36.98/20.75 [2019-03-28 12:39:29,909 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 36.98/20.75 [2019-03-28 12:39:29,909 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,913 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,913 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,914 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 36.98/20.75 [2019-03-28 12:39:29,919 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 36.98/20.75 [2019-03-28 12:39:29,919 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,925 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,926 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,926 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 36.98/20.75 [2019-03-28 12:39:29,933 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 36.98/20.75 [2019-03-28 12:39:29,934 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,940 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,940 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,941 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 36.98/20.75 [2019-03-28 12:39:29,950 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,951 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 36.98/20.75 [2019-03-28 12:39:29,952 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,958 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.98/20.75 [2019-03-28 12:39:29,959 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 36.98/20.75 [2019-03-28 12:39:29,959 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 36.98/20.75 [2019-03-28 12:39:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 36.98/20.75 [2019-03-28 12:39:30,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.98/20.75 [2019-03-28 12:39:30,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 36.98/20.75 [2019-03-28 12:39:30,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 36.98/20.75 [2019-03-28 12:39:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 36.98/20.75 [2019-03-28 12:39:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 36.98/20.75 [2019-03-28 12:39:30,015 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 11 states. 36.98/20.75 [2019-03-28 12:39:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.75 [2019-03-28 12:39:30,158 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. 36.98/20.75 [2019-03-28 12:39:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 36.98/20.75 [2019-03-28 12:39:30,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 36.98/20.75 [2019-03-28 12:39:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.98/20.75 [2019-03-28 12:39:30,159 INFO L225 Difference]: With dead ends: 19 36.98/20.75 [2019-03-28 12:39:30,159 INFO L226 Difference]: Without dead ends: 0 36.98/20.75 [2019-03-28 12:39:30,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 36.98/20.75 [2019-03-28 12:39:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 36.98/20.75 [2019-03-28 12:39:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 36.98/20.75 [2019-03-28 12:39:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 36.98/20.75 [2019-03-28 12:39:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 36.98/20.75 [2019-03-28 12:39:30,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 36.98/20.75 [2019-03-28 12:39:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. 36.98/20.75 [2019-03-28 12:39:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 36.98/20.75 [2019-03-28 12:39:30,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 36.98/20.75 [2019-03-28 12:39:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 36.98/20.75 [2019-03-28 12:39:30,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 36.98/20.75 [2019-03-28 12:39:30,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 36.98/20.75 [2019-03-28 12:39:30,624 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 36.98/20.75 [2019-03-28 12:39:30,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,627 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 11 26) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,628 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,629 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 11 26) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,629 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,629 INFO L448 ceAbstractionStarter]: For program point L7-2(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,629 INFO L448 ceAbstractionStarter]: For program point L7-4(line 7) no Hoare annotation was computed. 36.98/20.75 [2019-03-28 12:39:30,629 INFO L444 ceAbstractionStarter]: At program point L7-5(line 7) the Hoare annotation is: (let ((.cse17 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse0 (not (= ULTIMATE.start_cstpcpy_~to.base ULTIMATE.start_cstpcpy_~from.base))) (.cse1 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse6 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse11 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base) (+ (select |#length| ULTIMATE.start_cstpcpy_~from.base) ULTIMATE.start_main_~nondetString~0.offset (- 1))) 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse15 (<= ULTIMATE.start_main_~length2~0 .cse17)) (.cse13 (select |#length| ULTIMATE.start_cstpcpy_~to.base)) (.cse2 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse3 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse12 (select |#length| ULTIMATE.start_cstpcpy_~from.base)) (.cse4 (= ULTIMATE.start_cstpcpy_~to.offset 0)) (.cse5 (= 0 ULTIMATE.start_cstpcpy_~from.offset)) (.cse7 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse8 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse10 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstpcpy_~to.base))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstpcpy_~from.base))) (.cse16 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_cstpcpy_~from.offset ULTIMATE.start_main_~nondetString~0.offset) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstpcpy_~from.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 1 ULTIMATE.start_main_~length2~0))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse12 .cse13) .cse14 .cse15 .cse16) (and .cse0 .cse1 (<= 1 ULTIMATE.start_cstpcpy_~from.offset) .cse2 (<= (+ ULTIMATE.start_cstpcpy_~from.offset 1) .cse12) .cse3 (<= 1 ULTIMATE.start_cstpcpy_~to.offset) .cse6 .cse7 (<= (+ ULTIMATE.start_cstpcpy_~to.offset .cse12) (+ .cse13 ULTIMATE.start_cstpcpy_~from.offset)) .cse8 .cse10 .cse9 .cse11 .cse15 .cse14 .cse16) (and (<= 1 .cse13) (<= ULTIMATE.start_main_~length1~0 1) .cse2 .cse3 (<= 1 .cse12) (<= 1 .cse17) .cse4 .cse5 .cse7 (= 0 (select (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base) ULTIMATE.start_cstpcpy_~from.offset)) .cse8 (= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse10 .cse9 .cse14 .cse16)))) 36.98/20.75 [2019-03-28 12:39:30,630 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 36.98/20.75 [2019-03-28 12:39:30,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,649 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.75 [2019-03-28 12:39:30,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.75 [2019-03-28 12:39:30,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.75 [2019-03-28 12:39:30,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:30 BasicIcfg 36.98/20.75 [2019-03-28 12:39:30,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 36.98/20.75 [2019-03-28 12:39:30,678 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 36.98/20.75 [2019-03-28 12:39:30,678 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 36.98/20.75 [2019-03-28 12:39:30,681 INFO L276 PluginConnector]: BuchiAutomizer initialized 36.98/20.75 [2019-03-28 12:39:30,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.98/20.75 [2019-03-28 12:39:30,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:39:16" (1/5) ... 36.98/20.75 [2019-03-28 12:39:30,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@638d30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:30, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:30,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.98/20.75 [2019-03-28 12:39:30,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:16" (2/5) ... 36.98/20.75 [2019-03-28 12:39:30,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@638d30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:30, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:30,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.98/20.75 [2019-03-28 12:39:30,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:17" (3/5) ... 36.98/20.75 [2019-03-28 12:39:30,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@638d30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:30, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:30,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.98/20.75 [2019-03-28 12:39:30,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:17" (4/5) ... 36.98/20.75 [2019-03-28 12:39:30,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@638d30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:30, skipping insertion in model container 36.98/20.75 [2019-03-28 12:39:30,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.98/20.75 [2019-03-28 12:39:30,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:30" (5/5) ... 36.98/20.75 [2019-03-28 12:39:30,686 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 36.98/20.75 [2019-03-28 12:39:30,707 INFO L133 ementStrategyFactory]: Using default assertion order modulation 36.98/20.75 [2019-03-28 12:39:30,707 INFO L374 BuchiCegarLoop]: Interprodecural is true 36.98/20.75 [2019-03-28 12:39:30,708 INFO L375 BuchiCegarLoop]: Hoare is true 36.98/20.75 [2019-03-28 12:39:30,708 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 36.98/20.75 [2019-03-28 12:39:30,708 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 36.98/20.75 [2019-03-28 12:39:30,708 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 36.98/20.75 [2019-03-28 12:39:30,708 INFO L379 BuchiCegarLoop]: Difference is false 36.98/20.75 [2019-03-28 12:39:30,708 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 36.98/20.75 [2019-03-28 12:39:30,708 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 36.98/20.75 [2019-03-28 12:39:30,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 36.98/20.75 [2019-03-28 12:39:30,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.98/20.75 [2019-03-28 12:39:30,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 36.98/20.75 [2019-03-28 12:39:30,716 INFO L119 BuchiIsEmpty]: Starting construction of run 36.98/20.75 [2019-03-28 12:39:30,720 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:30,720 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:30,720 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 36.98/20.75 [2019-03-28 12:39:30,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 36.98/20.75 [2019-03-28 12:39:30,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.98/20.75 [2019-03-28 12:39:30,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 36.98/20.75 [2019-03-28 12:39:30,722 INFO L119 BuchiIsEmpty]: Starting construction of run 36.98/20.75 [2019-03-28 12:39:30,722 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:30,722 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 36.98/20.75 [2019-03-28 12:39:30,727 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L14: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 16#L14true [75] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 12#L14-2true [61] L14-2-->L17-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 4#L17-1true [88] L17-1-->L23: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 13#L23true [105] L23-->L7-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= |v_ULTIMATE.start_cstpcpy_#in~from.base_2| v_ULTIMATE.start_cstpcpy_~from.base_8) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (= v_ULTIMATE.start_cstpcpy_~from.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_cstpcpy_~to.offset_8 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstpcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstpcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstpcpy_~to.base_9 |v_ULTIMATE.start_cstpcpy_#in~to.base_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) 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_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstpcpy_#in~from.offset=|v_ULTIMATE.start_cstpcpy_#in~from.offset_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstpcpy_#res.base=|v_ULTIMATE.start_cstpcpy_#res.base_4|, ULTIMATE.start_cstpcpy_#in~to.offset=|v_ULTIMATE.start_cstpcpy_#in~to.offset_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_4|, ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstpcpy_#res.offset=|v_ULTIMATE.start_cstpcpy_#res.offset_4|, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_7, ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, ULTIMATE.start_cstpcpy_#in~from.base=|v_ULTIMATE.start_cstpcpy_#in~from.base_2|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_4|, #length=|v_#length_10|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_8, ULTIMATE.start_cstpcpy_#in~to.base=|v_ULTIMATE.start_cstpcpy_#in~to.base_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_9, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#in~from.offset, ULTIMATE.start_cstpcpy_#res.base, ULTIMATE.start_cstpcpy_#in~to.offset, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~mem2, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#res.offset, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#in~from.base, #memory_int, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_#in~to.base, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 14#L7-5true 36.98/20.75 [2019-03-28 12:39:30,728 INFO L796 eck$LassoCheckResult]: Loop: 14#L7-5true [66] L7-5-->L7-1: Formula: (and (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstpcpy_~from.base_3) v_ULTIMATE.start_cstpcpy_~from.offset_3) |v_ULTIMATE.start_cstpcpy_#t~mem2_2|) (<= (+ v_ULTIMATE.start_cstpcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstpcpy_~from.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~from.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_cstpcpy_~from.base_3) 1)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_2|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 5#L7-1true [53] L7-1-->L7-2: Formula: (and (= (store |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3) v_ULTIMATE.start_cstpcpy_~to.offset_3 |v_ULTIMATE.start_cstpcpy_#t~mem2_3|)) |v_#memory_int_4|) (= (select |v_#valid_10| v_ULTIMATE.start_cstpcpy_~to.base_3) 1) (<= (+ v_ULTIMATE.start_cstpcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstpcpy_~to.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~to.offset_3)) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} AuxVars[] AssignedVars[#memory_int] 3#L7-2true [101] L7-2-->L7-4: Formula: (> |v_ULTIMATE.start_cstpcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 15#L7-4true [71] L7-4-->L7-5: Formula: (and (= v_ULTIMATE.start_cstpcpy_~from.base_6 v_ULTIMATE.start_cstpcpy_~from.base_7) (= v_ULTIMATE.start_cstpcpy_~to.base_6 v_ULTIMATE.start_cstpcpy_~to.base_7) (= v_ULTIMATE.start_cstpcpy_~to.offset_5 (+ v_ULTIMATE.start_cstpcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstpcpy_~from.offset_5 (+ v_ULTIMATE.start_cstpcpy_~from.offset_6 1))) InVars {ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_7, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_6, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_7} OutVars{ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_2|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_6, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_5, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 14#L7-5true 36.98/20.75 [2019-03-28 12:39:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.75 [2019-03-28 12:39:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 126047593, now seen corresponding path program 1 times 36.98/20.75 [2019-03-28 12:39:30,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.75 [2019-03-28 12:39:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.75 [2019-03-28 12:39:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.75 [2019-03-28 12:39:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.75 [2019-03-28 12:39:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.75 [2019-03-28 12:39:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.76 [2019-03-28 12:39:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2943862, now seen corresponding path program 1 times 36.98/20.76 [2019-03-28 12:39:30,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.76 [2019-03-28 12:39:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.76 [2019-03-28 12:39:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:30,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:30,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.76 [2019-03-28 12:39:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1102531806, now seen corresponding path program 1 times 36.98/20.76 [2019-03-28 12:39:30,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.76 [2019-03-28 12:39:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.76 [2019-03-28 12:39:30,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.76 [2019-03-28 12:39:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.76 [2019-03-28 12:39:30,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.98/20.76 [2019-03-28 12:39:30,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 36.98/20.76 [2019-03-28 12:39:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 36.98/20.76 [2019-03-28 12:39:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 36.98/20.76 [2019-03-28 12:39:30,909 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. 36.98/20.76 [2019-03-28 12:39:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.98/20.76 [2019-03-28 12:39:31,042 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. 36.98/20.76 [2019-03-28 12:39:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 36.98/20.76 [2019-03-28 12:39:31,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 45 transitions. 36.98/20.76 [2019-03-28 12:39:31,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.98/20.76 [2019-03-28 12:39:31,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 36.98/20.76 [2019-03-28 12:39:31,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 36.98/20.76 [2019-03-28 12:39:31,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 36.98/20.76 [2019-03-28 12:39:31,049 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 36.98/20.76 [2019-03-28 12:39:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 36.98/20.76 [2019-03-28 12:39:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,051 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,051 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,052 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 36.98/20.76 [2019-03-28 12:39:31,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. 36.98/20.76 [2019-03-28 12:39:31,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.98/20.76 [2019-03-28 12:39:31,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 36.98/20.76 [2019-03-28 12:39:31,052 INFO L119 BuchiIsEmpty]: Starting construction of run 36.98/20.76 [2019-03-28 12:39:31,053 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 36.98/20.76 [2019-03-28 12:39:31,053 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 36.98/20.76 [2019-03-28 12:39:31,054 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY [103] ULTIMATE.startENTRY-->L14: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 64#L14 [75] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 66#L14-2 [76] L14-2-->L17-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 61#L17-1 [88] L17-1-->L23: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 62#L23 [105] L23-->L7-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= |v_ULTIMATE.start_cstpcpy_#in~from.base_2| v_ULTIMATE.start_cstpcpy_~from.base_8) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (= v_ULTIMATE.start_cstpcpy_~from.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_cstpcpy_~to.offset_8 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstpcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstpcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstpcpy_~to.base_9 |v_ULTIMATE.start_cstpcpy_#in~to.base_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) 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_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstpcpy_#in~from.offset=|v_ULTIMATE.start_cstpcpy_#in~from.offset_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstpcpy_#res.base=|v_ULTIMATE.start_cstpcpy_#res.base_4|, ULTIMATE.start_cstpcpy_#in~to.offset=|v_ULTIMATE.start_cstpcpy_#in~to.offset_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_4|, ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstpcpy_#res.offset=|v_ULTIMATE.start_cstpcpy_#res.offset_4|, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_7, ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, ULTIMATE.start_cstpcpy_#in~from.base=|v_ULTIMATE.start_cstpcpy_#in~from.base_2|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_4|, #length=|v_#length_10|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_8, ULTIMATE.start_cstpcpy_#in~to.base=|v_ULTIMATE.start_cstpcpy_#in~to.base_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_9, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#in~from.offset, ULTIMATE.start_cstpcpy_#res.base, ULTIMATE.start_cstpcpy_#in~to.offset, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~mem2, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#res.offset, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#in~from.base, #memory_int, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_#in~to.base, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 67#L7-5 36.98/20.76 [2019-03-28 12:39:31,054 INFO L796 eck$LassoCheckResult]: Loop: 67#L7-5 [66] L7-5-->L7-1: Formula: (and (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstpcpy_~from.base_3) v_ULTIMATE.start_cstpcpy_~from.offset_3) |v_ULTIMATE.start_cstpcpy_#t~mem2_2|) (<= (+ v_ULTIMATE.start_cstpcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstpcpy_~from.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~from.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_cstpcpy_~from.base_3) 1)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_2|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 65#L7-1 [53] L7-1-->L7-2: Formula: (and (= (store |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3) v_ULTIMATE.start_cstpcpy_~to.offset_3 |v_ULTIMATE.start_cstpcpy_#t~mem2_3|)) |v_#memory_int_4|) (= (select |v_#valid_10| v_ULTIMATE.start_cstpcpy_~to.base_3) 1) (<= (+ v_ULTIMATE.start_cstpcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstpcpy_~to.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~to.offset_3)) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} AuxVars[] AssignedVars[#memory_int] 59#L7-2 [101] L7-2-->L7-4: Formula: (> |v_ULTIMATE.start_cstpcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 60#L7-4 [71] L7-4-->L7-5: Formula: (and (= v_ULTIMATE.start_cstpcpy_~from.base_6 v_ULTIMATE.start_cstpcpy_~from.base_7) (= v_ULTIMATE.start_cstpcpy_~to.base_6 v_ULTIMATE.start_cstpcpy_~to.base_7) (= v_ULTIMATE.start_cstpcpy_~to.offset_5 (+ v_ULTIMATE.start_cstpcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstpcpy_~from.offset_5 (+ v_ULTIMATE.start_cstpcpy_~from.offset_6 1))) InVars {ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_7, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_6, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_7} OutVars{ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_2|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_6, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_5, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 67#L7-5 36.98/20.76 [2019-03-28 12:39:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.76 [2019-03-28 12:39:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times 36.98/20.76 [2019-03-28 12:39:31,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.76 [2019-03-28 12:39:31,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.76 [2019-03-28 12:39:31,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.76 [2019-03-28 12:39:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2943862, now seen corresponding path program 2 times 36.98/20.76 [2019-03-28 12:39:31,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.76 [2019-03-28 12:39:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.76 [2019-03-28 12:39:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.76 [2019-03-28 12:39:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1530185133, now seen corresponding path program 1 times 36.98/20.76 [2019-03-28 12:39:31,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.98/20.76 [2019-03-28 12:39:31,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.98/20.76 [2019-03-28 12:39:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.98/20.76 [2019-03-28 12:39:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.98/20.76 [2019-03-28 12:39:31,406 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 36.98/20.76 [2019-03-28 12:39:31,507 INFO L216 LassoAnalysis]: Preferences: 36.98/20.76 [2019-03-28 12:39:31,508 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 36.98/20.76 [2019-03-28 12:39:31,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 36.98/20.76 [2019-03-28 12:39:31,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 36.98/20.76 [2019-03-28 12:39:31,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false 36.98/20.76 [2019-03-28 12:39:31,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 36.98/20.76 [2019-03-28 12:39:31,509 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 36.98/20.76 [2019-03-28 12:39:31,509 INFO L130 ssoRankerPreferences]: Path of dumped script: 36.98/20.76 [2019-03-28 12:39:31,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 36.98/20.76 [2019-03-28 12:39:31,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 36.98/20.76 [2019-03-28 12:39:31,510 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 36.98/20.76 [2019-03-28 12:39:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,785 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 36.98/20.76 [2019-03-28 12:39:31,904 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 36.98/20.76 [2019-03-28 12:39:31,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:31,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.98/20.76 [2019-03-28 12:39:32,313 INFO L300 LassoAnalysis]: Preprocessing complete. 36.98/20.76 [2019-03-28 12:39:32,318 INFO L497 LassoAnalysis]: Using template 'affine'. 36.98/20.76 [2019-03-28 12:39:32,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.98/20.76 [2019-03-28 12:39:32,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.98/20.76 [2019-03-28 12:39:32,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.98/20.76 [2019-03-28 12:39:32,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.98/20.76 [2019-03-28 12:39:32,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.98/20.76 Termination analysis: LINEAR_WITH_GUESSES 36.98/20.76 Number of strict supporting invariants: 0 36.98/20.76 Number of non-strict supporting invariants: 1 36.98/20.76 Consider only non-deceasing supporting invariants: true 36.98/20.76 Simplify termination arguments: true 36.98/20.76 Simplify supporting invariants: trueOverapproximate stem: false 36.98/20.76 [2019-03-28 12:39:32,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.98/20.76 [2019-03-28 12:39:32,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.98/20.76 [2019-03-28 12:39:32,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.98/20.76 [2019-03-28 12:39:32,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.98/20.76 [2019-03-28 12:39:32,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.98/20.76 [2019-03-28 12:39:32,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.98/20.76 [2019-03-28 12:39:32,417 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 36.98/20.76 [2019-03-28 12:39:32,450 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 36.98/20.76 [2019-03-28 12:39:32,451 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. 36.98/20.76 [2019-03-28 12:39:32,453 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 36.98/20.76 [2019-03-28 12:39:32,455 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 36.98/20.76 [2019-03-28 12:39:32,455 INFO L518 LassoAnalysis]: Proved termination. 36.98/20.76 [2019-03-28 12:39:32,456 INFO L520 LassoAnalysis]: Termination argument consisting of: 36.98/20.76 Ranking function f(ULTIMATE.start_cstpcpy_~from.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cstpcpy_~from.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 36.98/20.76 Supporting invariants [] 36.98/20.76 [2019-03-28 12:39:32,495 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed 36.98/20.76 [2019-03-28 12:39:32,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.98/20.76 [2019-03-28 12:39:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.76 [2019-03-28 12:39:32,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core 36.98/20.76 [2019-03-28 12:39:32,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.76 [2019-03-28 12:39:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.76 [2019-03-28 12:39:32,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core 36.98/20.76 [2019-03-28 12:39:32,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.76 [2019-03-28 12:39:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.98/20.76 [2019-03-28 12:39:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.98/20.76 [2019-03-28 12:39:32,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core 36.98/20.76 [2019-03-28 12:39:32,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.98/20.76 [2019-03-28 12:39:32,701 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 36.98/20.76 [2019-03-28 12:39:32,707 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 36.98/20.76 [2019-03-28 12:39:32,708 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 4 states. 36.98/20.76 [2019-03-28 12:39:32,772 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 13 states and 20 transitions. Complement of second has 5 states. 36.98/20.76 [2019-03-28 12:39:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 36.98/20.76 [2019-03-28 12:39:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 36.98/20.76 [2019-03-28 12:39:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. 36.98/20.76 [2019-03-28 12:39:32,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 4 letters. 36.98/20.76 [2019-03-28 12:39:32,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. 36.98/20.76 [2019-03-28 12:39:32,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. 36.98/20.76 [2019-03-28 12:39:32,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. 36.98/20.76 [2019-03-28 12:39:32,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 8 letters. 36.98/20.76 [2019-03-28 12:39:32,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. 36.98/20.76 [2019-03-28 12:39:32,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. 36.98/20.76 [2019-03-28 12:39:32,782 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 36.98/20.76 [2019-03-28 12:39:32,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. 36.98/20.76 [2019-03-28 12:39:32,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 36.98/20.76 [2019-03-28 12:39:32,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 36.98/20.76 [2019-03-28 12:39:32,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 36.98/20.76 [2019-03-28 12:39:32,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 36.98/20.76 [2019-03-28 12:39:32,783 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 36.98/20.76 [2019-03-28 12:39:32,783 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 36.98/20.76 [2019-03-28 12:39:32,783 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 36.98/20.76 [2019-03-28 12:39:32,783 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 36.98/20.76 [2019-03-28 12:39:32,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 36.98/20.76 [2019-03-28 12:39:32,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 36.98/20.76 [2019-03-28 12:39:32,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 36.98/20.76 [2019-03-28 12:39:32,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:32 BasicIcfg 36.98/20.76 [2019-03-28 12:39:32,790 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 36.98/20.76 [2019-03-28 12:39:32,791 INFO L168 Benchmark]: Toolchain (without parser) took 16283.41 ms. Allocated memory was 649.6 MB in the beginning and 845.2 MB in the end (delta: 195.6 MB). Free memory was 563.9 MB in the beginning and 591.9 MB in the end (delta: -28.0 MB). Peak memory consumption was 167.6 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,791 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.60 ms. Allocated memory was 649.6 MB in the beginning and 660.1 MB in the end (delta: 10.5 MB). Free memory was 563.9 MB in the beginning and 625.2 MB in the end (delta: -61.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.49 ms. Allocated memory is still 660.1 MB. Free memory was 625.2 MB in the beginning and 622.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,793 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 ms. Allocated memory is still 660.1 MB. Free memory was 622.1 MB in the beginning and 620.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,793 INFO L168 Benchmark]: RCFGBuilder took 286.85 ms. Allocated memory is still 660.1 MB. Free memory was 620.7 MB in the beginning and 601.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,794 INFO L168 Benchmark]: BlockEncodingV2 took 118.07 ms. Allocated memory is still 660.1 MB. Free memory was 601.0 MB in the beginning and 592.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,794 INFO L168 Benchmark]: TraceAbstraction took 13373.73 ms. Allocated memory was 660.1 MB in the beginning and 765.5 MB in the end (delta: 105.4 MB). Free memory was 592.9 MB in the beginning and 531.4 MB in the end (delta: 61.4 MB). Peak memory consumption was 166.8 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,795 INFO L168 Benchmark]: BuchiAutomizer took 2112.16 ms. Allocated memory was 765.5 MB in the beginning and 845.2 MB in the end (delta: 79.7 MB). Free memory was 531.4 MB in the beginning and 591.9 MB in the end (delta: -60.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. 36.98/20.76 [2019-03-28 12:39:32,799 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 36.98/20.76 --- Results --- 36.98/20.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 36.98/20.76 - StatisticsResult: Initial Icfg 36.98/20.76 22 locations, 26 edges 36.98/20.76 - StatisticsResult: Encoded RCFG 36.98/20.76 15 locations, 27 edges 36.98/20.76 * Results from de.uni_freiburg.informatik.ultimate.core: 36.98/20.76 - StatisticsResult: Toolchain Benchmarks 36.98/20.76 Benchmark results are: 36.98/20.76 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 36.98/20.76 * CACSL2BoogieTranslator took 315.60 ms. Allocated memory was 649.6 MB in the beginning and 660.1 MB in the end (delta: 10.5 MB). Free memory was 563.9 MB in the beginning and 625.2 MB in the end (delta: -61.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 36.98/20.76 * Boogie Procedure Inliner took 43.49 ms. Allocated memory is still 660.1 MB. Free memory was 625.2 MB in the beginning and 622.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 36.98/20.76 * Boogie Preprocessor took 27.95 ms. Allocated memory is still 660.1 MB. Free memory was 622.1 MB in the beginning and 620.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 36.98/20.76 * RCFGBuilder took 286.85 ms. Allocated memory is still 660.1 MB. Free memory was 620.7 MB in the beginning and 601.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 50.3 GB. 36.98/20.76 * BlockEncodingV2 took 118.07 ms. Allocated memory is still 660.1 MB. Free memory was 601.0 MB in the beginning and 592.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 36.98/20.76 * TraceAbstraction took 13373.73 ms. Allocated memory was 660.1 MB in the beginning and 765.5 MB in the end (delta: 105.4 MB). Free memory was 592.9 MB in the beginning and 531.4 MB in the end (delta: 61.4 MB). Peak memory consumption was 166.8 MB. Max. memory is 50.3 GB. 36.98/20.76 * BuchiAutomizer took 2112.16 ms. Allocated memory was 765.5 MB in the beginning and 845.2 MB in the end (delta: 79.7 MB). Free memory was 531.4 MB in the beginning and 591.9 MB in the end (delta: -60.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. 36.98/20.76 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #memory_int 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 - GenericResult: Unfinished Backtranslation 36.98/20.76 unknown boogie variable #length 36.98/20.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 36.98/20.76 - PositiveResult [Line: 23]: pointer dereference always succeeds 36.98/20.76 For all program executions holds that pointer dereference always succeeds at this location 36.98/20.76 - PositiveResult [Line: 7]: pointer dereference always succeeds 36.98/20.76 For all program executions holds that pointer dereference always succeeds at this location 36.98/20.76 - PositiveResult [Line: 7]: pointer dereference always succeeds 36.98/20.76 For all program executions holds that pointer dereference always succeeds at this location 36.98/20.76 - PositiveResult [Line: 7]: pointer dereference always succeeds 36.98/20.76 For all program executions holds that pointer dereference always succeeds at this location 36.98/20.76 - PositiveResult [Line: 7]: pointer dereference always succeeds 36.98/20.76 For all program executions holds that pointer dereference always succeeds at this location 36.98/20.76 - PositiveResult [Line: 23]: pointer dereference always succeeds 36.98/20.76 For all program executions holds that pointer dereference always succeeds at this location 36.98/20.76 - AllSpecificationsHoldResult: All specifications hold 36.98/20.76 6 specifications checked. All of them hold 36.98/20.76 - InvariantResult [Line: 7]: Loop Invariant 36.98/20.76 [2019-03-28 12:39:32,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.98/20.76 [2019-03-28 12:39:32,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 [2019-03-28 12:39:32,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.98/20.76 [2019-03-28 12:39:32,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.98/20.76 Derived loop invariant: (((((((((((((((((!(to == from) && !(nondetString == nondetArea)) && nondetArea == 0) && \valid[nondetArea] == 1) && to == 0) && 0 == from) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((from <= ULTIMATE.start_main_~nondetString~0.offset && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[from]) && 0 == unknown-#memory_int-unknown[from][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 <= length2) && nondetString == 0) && 1 <= length1) && 1 == \valid[to]) && \valid[nondetString] == 1) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && 1 == \valid[from]) && length2 <= unknown-#length-unknown[nondetArea]) && length2 == unknown-#length-unknown[nondetString]) || ((((((((((((((((!(to == from) && !(nondetString == nondetArea)) && 1 <= from) && nondetArea == 0) && from + 1 <= unknown-#length-unknown[from]) && \valid[nondetArea] == 1) && 1 <= to) && 1 <= length2) && nondetString == 0) && to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from) && 1 <= length1) && \valid[nondetString] == 1) && 1 == \valid[to]) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && length2 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[from]) && length2 == unknown-#length-unknown[nondetString])) || (((((((((((((((1 <= unknown-#length-unknown[to] && length1 <= 1) && nondetArea == 0) && \valid[nondetArea] == 1) && 1 <= unknown-#length-unknown[from]) && 1 <= unknown-#length-unknown[nondetArea]) && to == 0) && 0 == from) && nondetString == 0) && 0 == unknown-#memory_int-unknown[from][from]) && 1 <= length1) && length2 + nondetString == 1) && \valid[nondetString] == 1) && 1 == \valid[to]) && 1 == \valid[from]) && length2 == unknown-#length-unknown[nondetString]) 36.98/20.76 - StatisticsResult: Ultimate Automizer benchmark data 36.98/20.76 CFG has 1 procedures, 15 locations, 6 error locations. SAFE Result, 13.2s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 395 SDslu, 267 SDs, 0 SdLazy, 711 SolverSat, 195 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 276 HoareAnnotationTreeSize, 1 FomulaSimplifications, 154 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 185 ConstructedInterpolants, 7 QuantifiedInterpolants, 17175 SizeOfPredicates, 50 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 7/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 36.98/20.76 - StatisticsResult: Constructed decomposition of program 36.98/20.76 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * from + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. 36.98/20.76 - StatisticsResult: Timing statistics 36.98/20.76 BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 74 SDslu, 69 SDs, 0 SdLazy, 154 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf100 lsp96 ukn91 mio100 lsp46 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 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 36.98/20.76 - TerminationAnalysisResult: Termination proven 36.98/20.76 Buchi Automizer proved that your program is terminating 36.98/20.76 RESULT: Ultimate proved your program to be correct! 36.98/20.76 !SESSION 2019-03-28 12:39:13.232 ----------------------------------------------- 36.98/20.76 eclipse.buildId=unknown 36.98/20.76 java.version=1.8.0_181 36.98/20.76 java.vendor=Oracle Corporation 36.98/20.76 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 36.98/20.76 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 36.98/20.76 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 36.98/20.76 36.98/20.76 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:39:33.057 36.98/20.76 !MESSAGE The workspace will exit with unsaved changes in this session. 36.98/20.76 Received shutdown request... 36.98/20.76 Ultimate: 36.98/20.76 GTK+ Version Check 36.98/20.76 EOF