38.42/22.44 YES 38.42/22.44 38.42/22.44 Ultimate: Cannot open display: 38.42/22.44 This is Ultimate 0.1.24-8dc7c08-m 38.42/22.44 [2019-03-28 12:38:00,639 INFO L170 SettingsManager]: Resetting all preferences to default values... 38.42/22.44 [2019-03-28 12:38:00,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 38.42/22.44 [2019-03-28 12:38:00,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 38.42/22.44 [2019-03-28 12:38:00,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 38.42/22.44 [2019-03-28 12:38:00,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 38.42/22.44 [2019-03-28 12:38:00,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 38.42/22.44 [2019-03-28 12:38:00,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 38.42/22.44 [2019-03-28 12:38:00,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 38.42/22.44 [2019-03-28 12:38:00,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 38.42/22.44 [2019-03-28 12:38:00,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 38.42/22.44 [2019-03-28 12:38:00,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 38.42/22.44 [2019-03-28 12:38:00,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 38.42/22.44 [2019-03-28 12:38:00,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 38.42/22.44 [2019-03-28 12:38:00,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 38.42/22.44 [2019-03-28 12:38:00,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 38.42/22.44 [2019-03-28 12:38:00,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 38.42/22.44 [2019-03-28 12:38:00,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 38.42/22.44 [2019-03-28 12:38:00,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 38.42/22.44 [2019-03-28 12:38:00,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 38.42/22.44 [2019-03-28 12:38:00,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 38.42/22.44 [2019-03-28 12:38:00,676 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 38.42/22.44 [2019-03-28 12:38:00,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 38.42/22.44 [2019-03-28 12:38:00,677 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 38.42/22.44 [2019-03-28 12:38:00,678 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 38.42/22.44 [2019-03-28 12:38:00,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 38.42/22.44 [2019-03-28 12:38:00,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 38.42/22.44 [2019-03-28 12:38:00,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 38.42/22.44 [2019-03-28 12:38:00,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 38.42/22.44 [2019-03-28 12:38:00,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 38.42/22.44 [2019-03-28 12:38:00,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 38.42/22.44 [2019-03-28 12:38:00,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 38.42/22.44 [2019-03-28 12:38:00,684 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 38.42/22.44 [2019-03-28 12:38:00,698 INFO L110 SettingsManager]: Loading preferences was successful 38.42/22.44 [2019-03-28 12:38:00,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 38.42/22.44 [2019-03-28 12:38:00,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 38.42/22.44 [2019-03-28 12:38:00,700 INFO L133 SettingsManager]: * Rewrite not-equals=true 38.42/22.44 [2019-03-28 12:38:00,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 38.42/22.44 [2019-03-28 12:38:00,700 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 38.42/22.44 [2019-03-28 12:38:00,701 INFO L133 SettingsManager]: * Use SBE=true 38.42/22.44 [2019-03-28 12:38:00,701 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 38.42/22.44 [2019-03-28 12:38:00,701 INFO L133 SettingsManager]: * Use old map elimination=false 38.42/22.44 [2019-03-28 12:38:00,701 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 38.42/22.44 [2019-03-28 12:38:00,701 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 38.42/22.44 [2019-03-28 12:38:00,701 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 38.42/22.44 [2019-03-28 12:38:00,702 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 38.42/22.44 [2019-03-28 12:38:00,702 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 38.42/22.44 [2019-03-28 12:38:00,702 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 38.42/22.44 [2019-03-28 12:38:00,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 38.42/22.44 [2019-03-28 12:38:00,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 38.42/22.44 [2019-03-28 12:38:00,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE 38.42/22.44 [2019-03-28 12:38:00,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 38.42/22.44 [2019-03-28 12:38:00,703 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 38.42/22.44 [2019-03-28 12:38:00,703 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 38.42/22.44 [2019-03-28 12:38:00,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 38.42/22.44 [2019-03-28 12:38:00,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 38.42/22.44 [2019-03-28 12:38:00,704 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 38.42/22.44 [2019-03-28 12:38:00,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 38.42/22.44 [2019-03-28 12:38:00,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 38.42/22.44 [2019-03-28 12:38:00,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 38.42/22.44 [2019-03-28 12:38:00,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 38.42/22.44 [2019-03-28 12:38:00,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 38.42/22.44 [2019-03-28 12:38:00,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 38.42/22.44 [2019-03-28 12:38:00,745 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 38.42/22.44 [2019-03-28 12:38:00,749 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 38.42/22.44 [2019-03-28 12:38:00,751 INFO L271 PluginConnector]: Initializing CDTParser... 38.42/22.44 [2019-03-28 12:38:00,751 INFO L276 PluginConnector]: CDTParser initialized 38.42/22.44 [2019-03-28 12:38:00,752 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 38.42/22.44 [2019-03-28 12:38:00,820 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/5d824e8a17424c3a980787aee507b512/FLAGd883c3489 38.42/22.44 [2019-03-28 12:38:01,174 INFO L307 CDTParser]: Found 1 translation units. 38.42/22.44 [2019-03-28 12:38:01,175 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 38.42/22.44 [2019-03-28 12:38:01,175 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 38.42/22.44 [2019-03-28 12:38:01,181 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/5d824e8a17424c3a980787aee507b512/FLAGd883c3489 38.42/22.44 [2019-03-28 12:38:01,597 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/5d824e8a17424c3a980787aee507b512 38.42/22.44 [2019-03-28 12:38:01,609 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 38.42/22.44 [2019-03-28 12:38:01,611 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 38.42/22.44 [2019-03-28 12:38:01,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 38.42/22.44 [2019-03-28 12:38:01,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 38.42/22.44 [2019-03-28 12:38:01,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 38.42/22.44 [2019-03-28 12:38:01,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f3dc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01, skipping insertion in model container 38.42/22.44 [2019-03-28 12:38:01,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 38.42/22.44 [2019-03-28 12:38:01,646 INFO L176 MainTranslator]: Built tables and reachable declarations 38.42/22.44 [2019-03-28 12:38:01,810 INFO L206 PostProcessor]: Analyzing one entry point: main 38.42/22.44 [2019-03-28 12:38:01,822 INFO L191 MainTranslator]: Completed pre-run 38.42/22.44 [2019-03-28 12:38:01,897 INFO L206 PostProcessor]: Analyzing one entry point: main 38.42/22.44 [2019-03-28 12:38:01,913 INFO L195 MainTranslator]: Completed translation 38.42/22.44 [2019-03-28 12:38:01,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01 WrapperNode 38.42/22.44 [2019-03-28 12:38:01,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 38.42/22.44 [2019-03-28 12:38:01,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 38.42/22.44 [2019-03-28 12:38:01,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 38.42/22.44 [2019-03-28 12:38:01,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 38.42/22.44 [2019-03-28 12:38:01,924 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:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,934 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:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 38.42/22.44 [2019-03-28 12:38:01,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 38.42/22.44 [2019-03-28 12:38:01,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 38.42/22.44 [2019-03-28 12:38:01,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized 38.42/22.44 [2019-03-28 12:38:01,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 [2019-03-28 12:38:01,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 38.42/22.44 [2019-03-28 12:38:01,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 38.42/22.44 [2019-03-28 12:38:01,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... 38.42/22.44 [2019-03-28 12:38:01,982 INFO L276 PluginConnector]: RCFGBuilder initialized 38.42/22.44 [2019-03-28 12:38:01,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 38.42/22.44 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.44 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 38.42/22.44 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 38.42/22.44 [2019-03-28 12:38:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 38.42/22.44 [2019-03-28 12:38:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 38.42/22.44 [2019-03-28 12:38:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 38.42/22.44 [2019-03-28 12:38:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 38.42/22.44 [2019-03-28 12:38:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 38.42/22.44 [2019-03-28 12:38:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 38.42/22.44 [2019-03-28 12:38:02,260 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 38.42/22.44 [2019-03-28 12:38:02,260 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 38.42/22.44 [2019-03-28 12:38:02,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02 BoogieIcfgContainer 38.42/22.44 [2019-03-28 12:38:02,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 38.42/22.44 [2019-03-28 12:38:02,263 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 38.42/22.44 [2019-03-28 12:38:02,263 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 38.42/22.44 [2019-03-28 12:38:02,265 INFO L276 PluginConnector]: BlockEncodingV2 initialized 38.42/22.44 [2019-03-28 12:38:02,266 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02" (1/1) ... 38.42/22.44 [2019-03-28 12:38:02,282 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges 38.42/22.44 [2019-03-28 12:38:02,283 INFO L258 BlockEncoder]: Using Remove infeasible edges 38.42/22.44 [2019-03-28 12:38:02,284 INFO L263 BlockEncoder]: Using Maximize final states 38.42/22.44 [2019-03-28 12:38:02,285 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 38.42/22.44 [2019-03-28 12:38:02,285 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 38.42/22.44 [2019-03-28 12:38:02,287 INFO L296 BlockEncoder]: Using Remove sink states 38.42/22.44 [2019-03-28 12:38:02,288 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 38.42/22.44 [2019-03-28 12:38:02,288 INFO L179 BlockEncoder]: Using Rewrite not-equals 38.42/22.44 [2019-03-28 12:38:02,307 INFO L185 BlockEncoder]: Using Use SBE 38.42/22.44 [2019-03-28 12:38:02,333 INFO L200 BlockEncoder]: SBE split 8 edges 38.42/22.44 [2019-03-28 12:38:02,338 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 38.42/22.44 [2019-03-28 12:38:02,340 INFO L71 MaximizeFinalStates]: 0 new accepting states 38.42/22.44 [2019-03-28 12:38:02,371 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 38.42/22.44 [2019-03-28 12:38:02,374 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 38.42/22.44 [2019-03-28 12:38:02,375 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 38.42/22.44 [2019-03-28 12:38:02,375 INFO L71 MaximizeFinalStates]: 0 new accepting states 38.42/22.44 [2019-03-28 12:38:02,376 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 38.42/22.44 [2019-03-28 12:38:02,376 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 38.42/22.44 [2019-03-28 12:38:02,377 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges 38.42/22.44 [2019-03-28 12:38:02,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:02 BasicIcfg 38.42/22.44 [2019-03-28 12:38:02,377 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 38.42/22.44 [2019-03-28 12:38:02,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 38.42/22.44 [2019-03-28 12:38:02,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... 38.42/22.44 [2019-03-28 12:38:02,382 INFO L276 PluginConnector]: TraceAbstraction initialized 38.42/22.44 [2019-03-28 12:38:02,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:38:01" (1/4) ... 38.42/22.44 [2019-03-28 12:38:02,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51319f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:02, skipping insertion in model container 38.42/22.44 [2019-03-28 12:38:02,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (2/4) ... 38.42/22.44 [2019-03-28 12:38:02,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51319f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:02, skipping insertion in model container 38.42/22.44 [2019-03-28 12:38:02,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02" (3/4) ... 38.42/22.44 [2019-03-28 12:38:02,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51319f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:02, skipping insertion in model container 38.42/22.44 [2019-03-28 12:38:02,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:02" (4/4) ... 38.42/22.44 [2019-03-28 12:38:02,387 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 38.42/22.44 [2019-03-28 12:38:02,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 38.42/22.44 [2019-03-28 12:38:02,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 38.42/22.44 [2019-03-28 12:38:02,425 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 38.42/22.44 [2019-03-28 12:38:02,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation 38.42/22.44 [2019-03-28 12:38:02,454 INFO L382 AbstractCegarLoop]: Interprodecural is true 38.42/22.44 [2019-03-28 12:38:02,455 INFO L383 AbstractCegarLoop]: Hoare is true 38.42/22.44 [2019-03-28 12:38:02,455 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 38.42/22.44 [2019-03-28 12:38:02,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 38.42/22.44 [2019-03-28 12:38:02,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 38.42/22.44 [2019-03-28 12:38:02,455 INFO L387 AbstractCegarLoop]: Difference is false 38.42/22.44 [2019-03-28 12:38:02,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 38.42/22.44 [2019-03-28 12:38:02,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 38.42/22.44 [2019-03-28 12:38:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. 38.42/22.44 [2019-03-28 12:38:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 38.42/22.44 [2019-03-28 12:38:02,477 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:02,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:02,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash 125559296, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:02,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:02,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:02,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:02,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.42/22.44 [2019-03-28 12:38:02,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.42/22.44 [2019-03-28 12:38:02,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.42/22.44 [2019-03-28 12:38:02,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.42/22.44 [2019-03-28 12:38:02,678 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. 38.42/22.44 [2019-03-28 12:38:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:02,753 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. 38.42/22.44 [2019-03-28 12:38:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.42/22.44 [2019-03-28 12:38:02,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 38.42/22.44 [2019-03-28 12:38:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:02,768 INFO L225 Difference]: With dead ends: 15 38.42/22.44 [2019-03-28 12:38:02,768 INFO L226 Difference]: Without dead ends: 14 38.42/22.44 [2019-03-28 12:38:02,772 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 38.42/22.44 [2019-03-28 12:38:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 38.42/22.44 [2019-03-28 12:38:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 38.42/22.44 [2019-03-28 12:38:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 38.42/22.44 [2019-03-28 12:38:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. 38.42/22.44 [2019-03-28 12:38:02,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 38.42/22.44 [2019-03-28 12:38:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:02,810 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. 38.42/22.44 [2019-03-28 12:38:02,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.42/22.44 [2019-03-28 12:38:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. 38.42/22.44 [2019-03-28 12:38:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 38.42/22.44 [2019-03-28 12:38:02,811 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:02,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:02,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash 125559298, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:02,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:02,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:02,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:02,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 38.42/22.44 [2019-03-28 12:38:02,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 38.42/22.44 [2019-03-28 12:38:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 38.42/22.44 [2019-03-28 12:38:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 38.42/22.44 [2019-03-28 12:38:02,856 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. 38.42/22.44 [2019-03-28 12:38:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:02,907 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. 38.42/22.44 [2019-03-28 12:38:02,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:02,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 38.42/22.44 [2019-03-28 12:38:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:02,909 INFO L225 Difference]: With dead ends: 15 38.42/22.44 [2019-03-28 12:38:02,909 INFO L226 Difference]: Without dead ends: 14 38.42/22.44 [2019-03-28 12:38:02,910 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 38.42/22.44 [2019-03-28 12:38:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 38.42/22.44 [2019-03-28 12:38:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 38.42/22.44 [2019-03-28 12:38:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 38.42/22.44 [2019-03-28 12:38:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. 38.42/22.44 [2019-03-28 12:38:02,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 38.42/22.44 [2019-03-28 12:38:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:02,914 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. 38.42/22.44 [2019-03-28 12:38:02,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. 38.42/22.44 [2019-03-28 12:38:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 38.42/22.44 [2019-03-28 12:38:02,914 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:02,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:02,915 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash 125559299, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:02,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:02,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:02,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:02,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.42/22.44 [2019-03-28 12:38:02,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.42/22.44 [2019-03-28 12:38:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.42/22.44 [2019-03-28 12:38:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.42/22.44 [2019-03-28 12:38:02,976 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. 38.42/22.44 [2019-03-28 12:38:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,027 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. 38.42/22.44 [2019-03-28 12:38:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.42/22.44 [2019-03-28 12:38:03,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 38.42/22.44 [2019-03-28 12:38:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,028 INFO L225 Difference]: With dead ends: 14 38.42/22.44 [2019-03-28 12:38:03,028 INFO L226 Difference]: Without dead ends: 13 38.42/22.44 [2019-03-28 12:38:03,029 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 38.42/22.44 [2019-03-28 12:38:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 38.42/22.44 [2019-03-28 12:38:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. 38.42/22.44 [2019-03-28 12:38:03,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 38.42/22.44 [2019-03-28 12:38:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,033 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. 38.42/22.44 [2019-03-28 12:38:03,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.42/22.44 [2019-03-28 12:38:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. 38.42/22.44 [2019-03-28 12:38:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 38.42/22.44 [2019-03-28 12:38:03,033 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,034 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash -402628528, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 38.42/22.44 [2019-03-28 12:38:03,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 38.42/22.44 [2019-03-28 12:38:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 38.42/22.44 [2019-03-28 12:38:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 38.42/22.44 [2019-03-28 12:38:03,075 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 4 states. 38.42/22.44 [2019-03-28 12:38:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,148 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. 38.42/22.44 [2019-03-28 12:38:03,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:03,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 38.42/22.44 [2019-03-28 12:38:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,149 INFO L225 Difference]: With dead ends: 22 38.42/22.44 [2019-03-28 12:38:03,149 INFO L226 Difference]: Without dead ends: 21 38.42/22.44 [2019-03-28 12:38:03,150 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 38.42/22.44 [2019-03-28 12:38:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 38.42/22.44 [2019-03-28 12:38:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. 38.42/22.44 [2019-03-28 12:38:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 38.42/22.44 [2019-03-28 12:38:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. 38.42/22.44 [2019-03-28 12:38:03,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 27 transitions. Word has length 6 38.42/22.44 [2019-03-28 12:38:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,155 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 27 transitions. 38.42/22.44 [2019-03-28 12:38:03,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 27 transitions. 38.42/22.44 [2019-03-28 12:38:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 38.42/22.44 [2019-03-28 12:38:03,155 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -402628531, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.42/22.44 [2019-03-28 12:38:03,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.42/22.44 [2019-03-28 12:38:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.42/22.44 [2019-03-28 12:38:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.42/22.44 [2019-03-28 12:38:03,187 INFO L87 Difference]: Start difference. First operand 14 states and 27 transitions. Second operand 3 states. 38.42/22.44 [2019-03-28 12:38:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,235 INFO L93 Difference]: Finished difference Result 14 states and 27 transitions. 38.42/22.44 [2019-03-28 12:38:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.42/22.44 [2019-03-28 12:38:03,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 38.42/22.44 [2019-03-28 12:38:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,237 INFO L225 Difference]: With dead ends: 14 38.42/22.44 [2019-03-28 12:38:03,237 INFO L226 Difference]: Without dead ends: 13 38.42/22.44 [2019-03-28 12:38:03,237 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 38.42/22.44 [2019-03-28 12:38:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 38.42/22.44 [2019-03-28 12:38:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. 38.42/22.44 [2019-03-28 12:38:03,241 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 6 38.42/22.44 [2019-03-28 12:38:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,241 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. 38.42/22.44 [2019-03-28 12:38:03,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.42/22.44 [2019-03-28 12:38:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. 38.42/22.44 [2019-03-28 12:38:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 38.42/22.44 [2019-03-28 12:38:03,242 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,242 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash -402628529, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 38.42/22.44 [2019-03-28 12:38:03,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 38.42/22.44 [2019-03-28 12:38:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 38.42/22.44 [2019-03-28 12:38:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 38.42/22.44 [2019-03-28 12:38:03,302 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. 38.42/22.44 [2019-03-28 12:38:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,370 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. 38.42/22.44 [2019-03-28 12:38:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 38.42/22.44 [2019-03-28 12:38:03,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 38.42/22.44 [2019-03-28 12:38:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,372 INFO L225 Difference]: With dead ends: 19 38.42/22.44 [2019-03-28 12:38:03,372 INFO L226 Difference]: Without dead ends: 18 38.42/22.44 [2019-03-28 12:38:03,372 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 38.42/22.44 [2019-03-28 12:38:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 38.42/22.44 [2019-03-28 12:38:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. 38.42/22.44 [2019-03-28 12:38:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 6 38.42/22.44 [2019-03-28 12:38:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,376 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 38.42/22.44 [2019-03-28 12:38:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 38.42/22.44 [2019-03-28 12:38:03,377 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,377 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash 403416315, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 38.42/22.44 [2019-03-28 12:38:03,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 38.42/22.44 [2019-03-28 12:38:03,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 38.42/22.44 [2019-03-28 12:38:03,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 38.42/22.44 [2019-03-28 12:38:03,430 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 4 states. 38.42/22.44 [2019-03-28 12:38:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,489 INFO L93 Difference]: Finished difference Result 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:03,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 38.42/22.44 [2019-03-28 12:38:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,490 INFO L225 Difference]: With dead ends: 13 38.42/22.44 [2019-03-28 12:38:03,491 INFO L226 Difference]: Without dead ends: 12 38.42/22.44 [2019-03-28 12:38:03,492 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 38.42/22.44 [2019-03-28 12:38:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 38.42/22.44 [2019-03-28 12:38:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 38.42/22.44 [2019-03-28 12:38:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 38.42/22.44 [2019-03-28 12:38:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. 38.42/22.44 [2019-03-28 12:38:03,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 7 38.42/22.44 [2019-03-28 12:38:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. 38.42/22.44 [2019-03-28 12:38:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. 38.42/22.44 [2019-03-28 12:38:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 38.42/22.44 [2019-03-28 12:38:03,496 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,496 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 403416317, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 38.42/22.44 [2019-03-28 12:38:03,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 38.42/22.44 [2019-03-28 12:38:03,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 38.42/22.44 [2019-03-28 12:38:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 38.42/22.44 [2019-03-28 12:38:03,532 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. 38.42/22.44 [2019-03-28 12:38:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,589 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. 38.42/22.44 [2019-03-28 12:38:03,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:03,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 38.42/22.44 [2019-03-28 12:38:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,590 INFO L225 Difference]: With dead ends: 17 38.42/22.44 [2019-03-28 12:38:03,591 INFO L226 Difference]: Without dead ends: 16 38.42/22.44 [2019-03-28 12:38:03,591 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 38.42/22.44 [2019-03-28 12:38:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 38.42/22.44 [2019-03-28 12:38:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. 38.42/22.44 [2019-03-28 12:38:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 7 38.42/22.44 [2019-03-28 12:38:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,595 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 38.42/22.44 [2019-03-28 12:38:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. 38.42/22.44 [2019-03-28 12:38:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 38.42/22.44 [2019-03-28 12:38:03,596 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,596 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash 403416318, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 38.42/22.44 [2019-03-28 12:38:03,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 38.42/22.44 [2019-03-28 12:38:03,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 38.42/22.44 [2019-03-28 12:38:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 38.42/22.44 [2019-03-28 12:38:03,651 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 5 states. 38.42/22.44 [2019-03-28 12:38:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,742 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. 38.42/22.44 [2019-03-28 12:38:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 38.42/22.44 [2019-03-28 12:38:03,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 38.42/22.44 [2019-03-28 12:38:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,744 INFO L225 Difference]: With dead ends: 16 38.42/22.44 [2019-03-28 12:38:03,744 INFO L226 Difference]: Without dead ends: 15 38.42/22.44 [2019-03-28 12:38:03,745 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 38.42/22.44 [2019-03-28 12:38:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 38.42/22.44 [2019-03-28 12:38:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. 38.42/22.44 [2019-03-28 12:38:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. 38.42/22.44 [2019-03-28 12:38:03,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 7 38.42/22.44 [2019-03-28 12:38:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,749 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. 38.42/22.44 [2019-03-28 12:38:03,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 38.42/22.44 [2019-03-28 12:38:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. 38.42/22.44 [2019-03-28 12:38:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 38.42/22.44 [2019-03-28 12:38:03,750 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,750 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash 856121391, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 38.42/22.44 [2019-03-28 12:38:03,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 38.42/22.44 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.44 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 38.42/22.44 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 38.42/22.44 [2019-03-28 12:38:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:03,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core 38.42/22.44 [2019-03-28 12:38:03,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.44 [2019-03-28 12:38:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:03,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:03,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 38.42/22.44 [2019-03-28 12:38:03,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 38.42/22.44 [2019-03-28 12:38:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 38.42/22.44 [2019-03-28 12:38:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 38.42/22.44 [2019-03-28 12:38:03,889 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 6 states. 38.42/22.44 [2019-03-28 12:38:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:03,960 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. 38.42/22.44 [2019-03-28 12:38:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 38.42/22.44 [2019-03-28 12:38:03,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 38.42/22.44 [2019-03-28 12:38:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:03,962 INFO L225 Difference]: With dead ends: 16 38.42/22.44 [2019-03-28 12:38:03,962 INFO L226 Difference]: Without dead ends: 15 38.42/22.44 [2019-03-28 12:38:03,962 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 38.42/22.44 [2019-03-28 12:38:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 38.42/22.44 [2019-03-28 12:38:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. 38.42/22.44 [2019-03-28 12:38:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. 38.42/22.44 [2019-03-28 12:38:03,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 38.42/22.44 [2019-03-28 12:38:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:03,966 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. 38.42/22.44 [2019-03-28 12:38:03,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 38.42/22.44 [2019-03-28 12:38:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. 38.42/22.44 [2019-03-28 12:38:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 38.42/22.44 [2019-03-28 12:38:03,967 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:03,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:03,967 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 856121390, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:03,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:03,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:03,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:04,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:04,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 38.42/22.44 [2019-03-28 12:38:04,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 38.42/22.44 [2019-03-28 12:38:04,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 38.42/22.44 [2019-03-28 12:38:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 38.42/22.44 [2019-03-28 12:38:04,064 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. 38.42/22.44 [2019-03-28 12:38:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:04,163 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. 38.42/22.44 [2019-03-28 12:38:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 38.42/22.44 [2019-03-28 12:38:04,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 38.42/22.44 [2019-03-28 12:38:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:04,164 INFO L225 Difference]: With dead ends: 24 38.42/22.44 [2019-03-28 12:38:04,164 INFO L226 Difference]: Without dead ends: 13 38.42/22.44 [2019-03-28 12:38:04,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 38.42/22.44 [2019-03-28 12:38:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 38.42/22.44 [2019-03-28 12:38:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. 38.42/22.44 [2019-03-28 12:38:04,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 38.42/22.44 [2019-03-28 12:38:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:04,168 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. 38.42/22.44 [2019-03-28 12:38:04,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 38.42/22.44 [2019-03-28 12:38:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. 38.42/22.44 [2019-03-28 12:38:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 38.42/22.44 [2019-03-28 12:38:04,169 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:04,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:04,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 667360179, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:04,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:04,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.42/22.44 [2019-03-28 12:38:04,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 38.42/22.44 [2019-03-28 12:38:04,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 38.42/22.44 [2019-03-28 12:38:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 38.42/22.44 [2019-03-28 12:38:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 38.42/22.44 [2019-03-28 12:38:04,255 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 7 states. 38.42/22.44 [2019-03-28 12:38:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.44 [2019-03-28 12:38:04,404 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. 38.42/22.44 [2019-03-28 12:38:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 38.42/22.44 [2019-03-28 12:38:04,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 38.42/22.44 [2019-03-28 12:38:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.44 [2019-03-28 12:38:04,405 INFO L225 Difference]: With dead ends: 25 38.42/22.44 [2019-03-28 12:38:04,405 INFO L226 Difference]: Without dead ends: 13 38.42/22.44 [2019-03-28 12:38:04,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 38.42/22.44 [2019-03-28 12:38:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 38.42/22.44 [2019-03-28 12:38:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 38.42/22.44 [2019-03-28 12:38:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 38.42/22.44 [2019-03-28 12:38:04,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 10 38.42/22.44 [2019-03-28 12:38:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.44 [2019-03-28 12:38:04,409 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. 38.42/22.44 [2019-03-28 12:38:04,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 38.42/22.44 [2019-03-28 12:38:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. 38.42/22.44 [2019-03-28 12:38:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 38.42/22.44 [2019-03-28 12:38:04,410 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.44 [2019-03-28 12:38:04,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 38.42/22.44 [2019-03-28 12:38:04,410 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.44 [2019-03-28 12:38:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.44 [2019-03-28 12:38:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1812859843, now seen corresponding path program 1 times 38.42/22.44 [2019-03-28 12:38:04,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.44 [2019-03-28 12:38:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.44 [2019-03-28 12:38:04,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.44 [2019-03-28 12:38:04,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 38.42/22.44 [2019-03-28 12:38:04,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 38.42/22.44 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.44 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 38.42/22.44 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 38.42/22.44 [2019-03-28 12:38:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.44 [2019-03-28 12:38:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.44 [2019-03-28 12:38:04,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core 38.42/22.44 [2019-03-28 12:38:04,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.44 [2019-03-28 12:38:04,643 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 38.42/22.44 [2019-03-28 12:38:04,644 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.44 [2019-03-28 12:38:04,653 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:04,654 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. 38.42/22.45 [2019-03-28 12:38:04,654 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 38.42/22.45 [2019-03-28 12:38:04,685 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:04,686 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 38.42/22.45 [2019-03-28 12:38:04,689 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 38.42/22.45 [2019-03-28 12:38:04,699 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:04,704 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 38.42/22.45 [2019-03-28 12:38:04,704 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 38.42/22.45 [2019-03-28 12:38:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:04,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 38.42/22.45 [2019-03-28 12:38:04,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 38.42/22.45 [2019-03-28 12:38:04,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 38.42/22.45 [2019-03-28 12:38:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 38.42/22.45 [2019-03-28 12:38:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 38.42/22.45 [2019-03-28 12:38:04,777 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 11 states. 38.42/22.45 [2019-03-28 12:38:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.45 [2019-03-28 12:38:05,078 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. 38.42/22.45 [2019-03-28 12:38:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 38.42/22.45 [2019-03-28 12:38:05,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 38.42/22.45 [2019-03-28 12:38:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.45 [2019-03-28 12:38:05,079 INFO L225 Difference]: With dead ends: 17 38.42/22.45 [2019-03-28 12:38:05,079 INFO L226 Difference]: Without dead ends: 16 38.42/22.45 [2019-03-28 12:38:05,080 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 38.42/22.45 [2019-03-28 12:38:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 38.42/22.45 [2019-03-28 12:38:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 38.42/22.45 [2019-03-28 12:38:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 38.42/22.45 [2019-03-28 12:38:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. 38.42/22.45 [2019-03-28 12:38:05,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 10 38.42/22.45 [2019-03-28 12:38:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.45 [2019-03-28 12:38:05,084 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. 38.42/22.45 [2019-03-28 12:38:05,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 38.42/22.45 [2019-03-28 12:38:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. 38.42/22.45 [2019-03-28 12:38:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 38.42/22.45 [2019-03-28 12:38:05,085 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.45 [2019-03-28 12:38:05,085 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:05,085 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.45 [2019-03-28 12:38:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash 364079113, now seen corresponding path program 1 times 38.42/22.45 [2019-03-28 12:38:05,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:05,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:05,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 38.42/22.45 [2019-03-28 12:38:05,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 38.42/22.45 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.45 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 38.42/22.45 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 38.42/22.45 [2019-03-28 12:38:05,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:05,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:05,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:05,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 38.42/22.45 [2019-03-28 12:38:05,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 38.42/22.45 [2019-03-28 12:38:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 38.42/22.45 [2019-03-28 12:38:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 38.42/22.45 [2019-03-28 12:38:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 38.42/22.45 [2019-03-28 12:38:05,205 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. 38.42/22.45 [2019-03-28 12:38:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.45 [2019-03-28 12:38:05,271 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. 38.42/22.45 [2019-03-28 12:38:05,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 38.42/22.45 [2019-03-28 12:38:05,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 38.42/22.45 [2019-03-28 12:38:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.45 [2019-03-28 12:38:05,272 INFO L225 Difference]: With dead ends: 17 38.42/22.45 [2019-03-28 12:38:05,272 INFO L226 Difference]: Without dead ends: 16 38.42/22.45 [2019-03-28 12:38:05,273 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 38.42/22.45 [2019-03-28 12:38:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 38.42/22.45 [2019-03-28 12:38:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 38.42/22.45 [2019-03-28 12:38:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 38.42/22.45 [2019-03-28 12:38:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 38.42/22.45 [2019-03-28 12:38:05,276 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 38.42/22.45 [2019-03-28 12:38:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.45 [2019-03-28 12:38:05,276 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. 38.42/22.45 [2019-03-28 12:38:05,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 38.42/22.45 [2019-03-28 12:38:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. 38.42/22.45 [2019-03-28 12:38:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 38.42/22.45 [2019-03-28 12:38:05,277 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.45 [2019-03-28 12:38:05,277 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:05,277 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.45 [2019-03-28 12:38:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash 364079114, now seen corresponding path program 1 times 38.42/22.45 [2019-03-28 12:38:05,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:05,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:05,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 38.42/22.45 [2019-03-28 12:38:05,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 38.42/22.45 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.45 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 38.42/22.45 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 38.42/22.45 [2019-03-28 12:38:05,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:05,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 29 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:05,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:05,388 INFO L189 IndexEqualityManager]: detected not equals via solver 38.42/22.45 [2019-03-28 12:38:05,392 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 38.42/22.45 [2019-03-28 12:38:05,393 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:05,411 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:05,420 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 38.42/22.45 [2019-03-28 12:38:05,421 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:05,433 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:05,433 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:05,434 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 38.42/22.45 [2019-03-28 12:38:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:05,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 38.42/22.45 [2019-03-28 12:38:05,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 38.42/22.45 [2019-03-28 12:38:05,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 38.42/22.45 [2019-03-28 12:38:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 38.42/22.45 [2019-03-28 12:38:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 38.42/22.45 [2019-03-28 12:38:05,574 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 11 states. 38.42/22.45 [2019-03-28 12:38:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.45 [2019-03-28 12:38:15,914 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. 38.42/22.45 [2019-03-28 12:38:15,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 38.42/22.45 [2019-03-28 12:38:15,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 38.42/22.45 [2019-03-28 12:38:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.45 [2019-03-28 12:38:15,915 INFO L225 Difference]: With dead ends: 19 38.42/22.45 [2019-03-28 12:38:15,915 INFO L226 Difference]: Without dead ends: 18 38.42/22.45 [2019-03-28 12:38:15,915 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 38.42/22.45 [2019-03-28 12:38:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 38.42/22.45 [2019-03-28 12:38:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. 38.42/22.45 [2019-03-28 12:38:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 38.42/22.45 [2019-03-28 12:38:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. 38.42/22.45 [2019-03-28 12:38:15,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 38.42/22.45 [2019-03-28 12:38:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.45 [2019-03-28 12:38:15,919 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. 38.42/22.45 [2019-03-28 12:38:15,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 38.42/22.45 [2019-03-28 12:38:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. 38.42/22.45 [2019-03-28 12:38:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 38.42/22.45 [2019-03-28 12:38:15,920 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.45 [2019-03-28 12:38:15,920 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:15,920 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.45 [2019-03-28 12:38:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548834, now seen corresponding path program 2 times 38.42/22.45 [2019-03-28 12:38:15,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:15,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:15,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:15,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:15,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:16,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 38.42/22.45 [2019-03-28 12:38:16,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 38.42/22.45 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.45 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 38.42/22.45 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 38.42/22.45 [2019-03-28 12:38:16,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 38.42/22.45 [2019-03-28 12:38:16,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 38.42/22.45 [2019-03-28 12:38:16,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:16,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 31 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:16,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:16,139 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 38.42/22.45 [2019-03-28 12:38:16,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:16,148 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 38.42/22.45 [2019-03-28 12:38:16,149 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:16,155 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,156 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 38.42/22.45 [2019-03-28 12:38:16,176 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 38.42/22.45 [2019-03-28 12:38:16,176 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,183 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:16,184 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. 38.42/22.45 [2019-03-28 12:38:16,184 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 38.42/22.45 [2019-03-28 12:38:16,212 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 38.42/22.45 [2019-03-28 12:38:16,213 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,222 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:16,223 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. 38.42/22.45 [2019-03-28 12:38:16,223 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:23 38.42/22.45 [2019-03-28 12:38:16,255 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:16,255 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 38.42/22.45 [2019-03-28 12:38:16,256 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,268 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:16,270 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:16,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 38.42/22.45 [2019-03-28 12:38:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:16,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 38.42/22.45 [2019-03-28 12:38:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 38.42/22.45 [2019-03-28 12:38:16,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 38.42/22.45 [2019-03-28 12:38:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 38.42/22.45 [2019-03-28 12:38:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 38.42/22.45 [2019-03-28 12:38:16,353 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 13 states. 38.42/22.45 [2019-03-28 12:38:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.45 [2019-03-28 12:38:16,883 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. 38.42/22.45 [2019-03-28 12:38:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 38.42/22.45 [2019-03-28 12:38:16,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 38.42/22.45 [2019-03-28 12:38:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.45 [2019-03-28 12:38:16,884 INFO L225 Difference]: With dead ends: 23 38.42/22.45 [2019-03-28 12:38:16,884 INFO L226 Difference]: Without dead ends: 22 38.42/22.45 [2019-03-28 12:38:16,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 38.42/22.45 [2019-03-28 12:38:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 38.42/22.45 [2019-03-28 12:38:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. 38.42/22.45 [2019-03-28 12:38:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 38.42/22.45 [2019-03-28 12:38:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. 38.42/22.45 [2019-03-28 12:38:16,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 38.42/22.45 [2019-03-28 12:38:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.45 [2019-03-28 12:38:16,889 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. 38.42/22.45 [2019-03-28 12:38:16,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 38.42/22.45 [2019-03-28 12:38:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. 38.42/22.45 [2019-03-28 12:38:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 38.42/22.45 [2019-03-28 12:38:16,890 INFO L394 BasicCegarLoop]: Found error trace 38.42/22.45 [2019-03-28 12:38:16,890 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:16,891 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 38.42/22.45 [2019-03-28 12:38:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1393404990, now seen corresponding path program 1 times 38.42/22.45 [2019-03-28 12:38:16,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:16,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:16,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:16,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 38.42/22.45 [2019-03-28 12:38:16,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 38.42/22.45 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.42/22.45 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 38.42/22.45 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 38.42/22.45 [2019-03-28 12:38:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:17,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:17,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:17,042 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 38.42/22.45 [2019-03-28 12:38:17,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,051 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 38.42/22.45 [2019-03-28 12:38:17,051 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,057 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,058 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,058 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 38.42/22.45 [2019-03-28 12:38:17,063 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 38.42/22.45 [2019-03-28 12:38:17,063 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,068 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,068 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,068 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 38.42/22.45 [2019-03-28 12:38:17,073 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 38.42/22.45 [2019-03-28 12:38:17,074 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,080 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,080 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,081 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 38.42/22.45 [2019-03-28 12:38:17,086 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 38.42/22.45 [2019-03-28 12:38:17,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,092 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,093 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,093 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 38.42/22.45 [2019-03-28 12:38:17,111 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,112 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 38.42/22.45 [2019-03-28 12:38:17,113 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.42/22.45 [2019-03-28 12:38:17,120 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 38.42/22.45 [2019-03-28 12:38:17,120 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 38.42/22.45 [2019-03-28 12:38:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:17,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 38.42/22.45 [2019-03-28 12:38:17,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 38.42/22.45 [2019-03-28 12:38:17,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 38.42/22.45 [2019-03-28 12:38:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 38.42/22.45 [2019-03-28 12:38:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 38.42/22.45 [2019-03-28 12:38:17,181 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 10 states. 38.42/22.45 [2019-03-28 12:38:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.42/22.45 [2019-03-28 12:38:17,324 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. 38.42/22.45 [2019-03-28 12:38:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 38.42/22.45 [2019-03-28 12:38:17,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 38.42/22.45 [2019-03-28 12:38:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.42/22.45 [2019-03-28 12:38:17,325 INFO L225 Difference]: With dead ends: 19 38.42/22.45 [2019-03-28 12:38:17,326 INFO L226 Difference]: Without dead ends: 0 38.42/22.45 [2019-03-28 12:38:17,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 38.42/22.45 [2019-03-28 12:38:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 38.42/22.45 [2019-03-28 12:38:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 38.42/22.45 [2019-03-28 12:38:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 38.42/22.45 [2019-03-28 12:38:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:17,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 38.42/22.45 [2019-03-28 12:38:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. 38.42/22.45 [2019-03-28 12:38:17,327 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:17,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 38.42/22.45 [2019-03-28 12:38:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:17,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 38.42/22.45 [2019-03-28 12:38:17,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:17,757 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 38.42/22.45 [2019-03-28 12:38:17,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 14 29) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 14 29) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,762 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,762 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,762 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,762 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,762 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. 38.42/22.45 [2019-03-28 12:38:17,763 INFO L444 ceAbstractionStarter]: At program point L10-5(line 10) the Hoare annotation is: (let ((.cse3 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (.cse12 (select |#memory_int| ULTIMATE.start_cstrcpy_~from.base)) (.cse9 (select |#length| ULTIMATE.start_cstrcpy_~from.base))) (let ((.cse14 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse0 (select |#length| ULTIMATE.start_cstrcpy_~to.base)) (.cse1 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse2 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse15 (not (= ULTIMATE.start_cstrcpy_~to.base ULTIMATE.start_cstrcpy_~from.base))) (.cse16 (= (select .cse12 (+ .cse9 (- 1))) 0)) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~to.base))) (.cse17 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse5 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse6 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse7 (= ULTIMATE.start_cstrcpy_~from.offset 0)) (.cse8 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse18 (<= ULTIMATE.start_main_~length2~0 .cse3)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~from.base))) (.cse10 (= 0 ULTIMATE.start_cstrcpy_~to.offset)) (.cse19 (<= (+ ULTIMATE.start_cstrcpy_~from.offset 1) .cse9)) (.cse13 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and (<= 1 .cse0) .cse1 .cse2 (<= 1 .cse3) .cse4 .cse5 .cse6 .cse7 (= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse8 (<= 1 .cse9) .cse10 .cse11 (= 0 (select .cse12 ULTIMATE.start_cstrcpy_~from.offset)) .cse13) (and .cse14 .cse1 .cse2 .cse15 (<= 1 ULTIMATE.start_cstrcpy_~to.offset) (<= (+ .cse9 ULTIMATE.start_cstrcpy_~to.offset) (+ ULTIMATE.start_cstrcpy_~from.offset .cse0)) .cse16 .cse4 .cse17 .cse5 (<= 1 ULTIMATE.start_cstrcpy_~from.offset) .cse6 .cse8 .cse18 .cse11 .cse19 .cse13) (and .cse14 (<= .cse9 .cse0) .cse1 .cse2 .cse15 .cse16 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18 .cse11 .cse10 .cse19 .cse13)))) 38.42/22.45 [2019-03-28 12:38:17,763 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 38.42/22.45 [2019-03-28 12:38:17,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:17,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:17,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:17,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:17,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:17,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:17,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:17,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:17 BasicIcfg 38.42/22.45 [2019-03-28 12:38:17,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 38.42/22.45 [2019-03-28 12:38:17,800 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 38.42/22.45 [2019-03-28 12:38:17,801 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 38.42/22.45 [2019-03-28 12:38:17,804 INFO L276 PluginConnector]: BuchiAutomizer initialized 38.42/22.45 [2019-03-28 12:38:17,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.42/22.45 [2019-03-28 12:38:17,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:38:01" (1/5) ... 38.42/22.45 [2019-03-28 12:38:17,806 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40c46153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:17, skipping insertion in model container 38.42/22.45 [2019-03-28 12:38:17,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.42/22.45 [2019-03-28 12:38:17,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (2/5) ... 38.42/22.45 [2019-03-28 12:38:17,806 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40c46153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:17, skipping insertion in model container 38.42/22.45 [2019-03-28 12:38:17,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.42/22.45 [2019-03-28 12:38:17,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02" (3/5) ... 38.42/22.45 [2019-03-28 12:38:17,807 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40c46153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:17, skipping insertion in model container 38.42/22.45 [2019-03-28 12:38:17,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.42/22.45 [2019-03-28 12:38:17,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:02" (4/5) ... 38.42/22.45 [2019-03-28 12:38:17,807 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40c46153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:17, skipping insertion in model container 38.42/22.45 [2019-03-28 12:38:17,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.42/22.45 [2019-03-28 12:38:17,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:17" (5/5) ... 38.42/22.45 [2019-03-28 12:38:17,809 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 38.42/22.45 [2019-03-28 12:38:17,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation 38.42/22.45 [2019-03-28 12:38:17,832 INFO L374 BuchiCegarLoop]: Interprodecural is true 38.42/22.45 [2019-03-28 12:38:17,832 INFO L375 BuchiCegarLoop]: Hoare is true 38.42/22.45 [2019-03-28 12:38:17,832 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 38.42/22.45 [2019-03-28 12:38:17,832 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 38.42/22.45 [2019-03-28 12:38:17,832 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 38.42/22.45 [2019-03-28 12:38:17,833 INFO L379 BuchiCegarLoop]: Difference is false 38.42/22.45 [2019-03-28 12:38:17,833 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 38.42/22.45 [2019-03-28 12:38:17,833 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 38.42/22.45 [2019-03-28 12:38:17,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 38.42/22.45 [2019-03-28 12:38:17,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 38.42/22.45 [2019-03-28 12:38:17,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 38.42/22.45 [2019-03-28 12:38:17,841 INFO L119 BuchiIsEmpty]: Starting construction of run 38.42/22.45 [2019-03-28 12:38:17,845 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:17,845 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:17,845 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 38.42/22.45 [2019-03-28 12:38:17,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 38.42/22.45 [2019-03-28 12:38:17,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 38.42/22.45 [2019-03-28 12:38:17,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 38.42/22.45 [2019-03-28 12:38:17,847 INFO L119 BuchiIsEmpty]: Starting construction of run 38.42/22.45 [2019-03-28 12:38:17,847 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:17,847 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 38.42/22.45 [2019-03-28 12:38:17,852 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L17: 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] 7#L17true [75] L17-->L17-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[] 3#L17-2true [76] L17-2-->L20-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[] 9#L20-1true [88] L20-1-->L26: 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|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= |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] 4#L26true [105] L26-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~to.offset_2|) (<= 1 .cse0) (= v_ULTIMATE.start_cstrcpy_~save~0.base_4 v_ULTIMATE.start_cstrcpy_~to.base_8) (= v_ULTIMATE.start_cstrcpy_~from.base_8 |v_ULTIMATE.start_cstrcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~from.offset_2| v_ULTIMATE.start_cstrcpy_~from.offset_7) (= v_ULTIMATE.start_cstrcpy_~save~0.offset_4 v_ULTIMATE.start_cstrcpy_~to.offset_7) (= |v_ULTIMATE.start_cstrcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstrcpy_~to.offset_7 |v_ULTIMATE.start_cstrcpy_#in~to.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~from.base_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_cstrcpy_#in~from.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= |v_ULTIMATE.start_cstrcpy_#in~to.base_2| v_ULTIMATE.start_cstrcpy_~to.base_8) (= |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_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrcpy_#t~pre1.base=|v_ULTIMATE.start_cstrcpy_#t~pre1.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_8, ULTIMATE.start_cstrcpy_#t~pre0.base=|v_ULTIMATE.start_cstrcpy_#t~pre0.base_4|, ULTIMATE.start_cstrcpy_#t~pre0.offset=|v_ULTIMATE.start_cstrcpy_#t~pre0.offset_4|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_8, ULTIMATE.start_cstrcpy_#in~to.base=|v_ULTIMATE.start_cstrcpy_#in~to.base_2|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_~save~0.offset=v_ULTIMATE.start_cstrcpy_~save~0.offset_4, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_7, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#in~from.offset=|v_ULTIMATE.start_cstrcpy_#in~from.offset_2|, ULTIMATE.start_cstrcpy_#in~to.offset=|v_ULTIMATE.start_cstrcpy_#in~to.offset_2|, ULTIMATE.start_cstrcpy_#in~from.base=|v_ULTIMATE.start_cstrcpy_#in~from.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_cstrcpy_#t~pre1.offset=|v_ULTIMATE.start_cstrcpy_#t~pre1.offset_4|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_~save~0.base=v_ULTIMATE.start_cstrcpy_~save~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_~save~0.offset, ULTIMATE.start_cstrcpy_~to.offset, ULTIMATE.start_cstrcpy_#t~pre1.base, ULTIMATE.start_cstrcpy_~from.base, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_#t~pre0.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#in~from.offset, ULTIMATE.start_cstrcpy_#t~pre0.offset, ULTIMATE.start_cstrcpy_~to.base, ULTIMATE.start_cstrcpy_#in~to.offset, ULTIMATE.start_cstrcpy_#in~from.base, ULTIMATE.start_cstrcpy_~from.offset, ULTIMATE.start_cstrcpy_#in~to.base, ULTIMATE.start_cstrcpy_#t~pre1.offset, #memory_int, ULTIMATE.start_cstrcpy_~save~0.base] 5#L10-5true 38.42/22.45 [2019-03-28 12:38:17,853 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-5true [54] L10-5-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_cstrcpy_~from.base_3) 1) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrcpy_~from.base_3) v_ULTIMATE.start_cstrcpy_~from.offset_3)) (<= 0 v_ULTIMATE.start_cstrcpy_~from.offset_3) (<= (+ v_ULTIMATE.start_cstrcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstrcpy_~from.base_3))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_3, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_3, #length=|v_#length_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 10#L10-1true [66] L10-1-->L10-2: Formula: (and (<= (+ v_ULTIMATE.start_cstrcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcpy_~to.base_3)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrcpy_~to.base_3)) (= |v_#memory_int_4| (store |v_#memory_int_5| v_ULTIMATE.start_cstrcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstrcpy_~to.base_3) v_ULTIMATE.start_cstrcpy_~to.offset_3 |v_ULTIMATE.start_cstrcpy_#t~mem2_3|))) (<= 0 v_ULTIMATE.start_cstrcpy_~to.offset_3)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_3, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_3, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 8#L10-2true [101] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_cstrcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 6#L10-4true [58] L10-4-->L10-5: Formula: (and (= v_ULTIMATE.start_cstrcpy_~from.offset_5 (+ v_ULTIMATE.start_cstrcpy_~from.offset_6 1)) (= v_ULTIMATE.start_cstrcpy_~to.base_6 v_ULTIMATE.start_cstrcpy_~to.base_7) (= v_ULTIMATE.start_cstrcpy_~to.offset_5 (+ v_ULTIMATE.start_cstrcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstrcpy_~from.base_6 v_ULTIMATE.start_cstrcpy_~from.base_7)) InVars {ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_7, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_7, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_6, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_6} OutVars{ULTIMATE.start_cstrcpy_#t~pre0.offset=|v_ULTIMATE.start_cstrcpy_#t~pre0.offset_2|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_6, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_5, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_5, ULTIMATE.start_cstrcpy_#t~pre1.base=|v_ULTIMATE.start_cstrcpy_#t~pre1.base_2|, ULTIMATE.start_cstrcpy_#t~pre1.offset=|v_ULTIMATE.start_cstrcpy_#t~pre1.offset_2|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_6, ULTIMATE.start_cstrcpy_#t~pre0.base=|v_ULTIMATE.start_cstrcpy_#t~pre0.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~pre0.offset, ULTIMATE.start_cstrcpy_~to.base, ULTIMATE.start_cstrcpy_~to.offset, ULTIMATE.start_cstrcpy_~from.offset, ULTIMATE.start_cstrcpy_#t~pre1.base, ULTIMATE.start_cstrcpy_#t~pre1.offset, ULTIMATE.start_cstrcpy_~from.base, ULTIMATE.start_cstrcpy_#t~pre0.base] 5#L10-5true 38.42/22.45 [2019-03-28 12:38:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times 38.42/22.45 [2019-03-28 12:38:17,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.42/22.45 [2019-03-28 12:38:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.42/22.45 [2019-03-28 12:38:17,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:17,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2598850, now seen corresponding path program 1 times 38.42/22.45 [2019-03-28 12:38:17,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.42/22.45 [2019-03-28 12:38:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.42/22.45 [2019-03-28 12:38:17,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1529840121, now seen corresponding path program 1 times 38.42/22.45 [2019-03-28 12:38:17,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.42/22.45 [2019-03-28 12:38:17,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.42/22.45 [2019-03-28 12:38:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.42/22.45 [2019-03-28 12:38:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.42/22.45 [2019-03-28 12:38:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.42/22.45 [2019-03-28 12:38:18,224 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 38.42/22.45 [2019-03-28 12:38:18,332 INFO L216 LassoAnalysis]: Preferences: 38.42/22.45 [2019-03-28 12:38:18,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 38.42/22.45 [2019-03-28 12:38:18,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 38.42/22.45 [2019-03-28 12:38:18,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 38.42/22.45 [2019-03-28 12:38:18,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false 38.42/22.45 [2019-03-28 12:38:18,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 38.42/22.45 [2019-03-28 12:38:18,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 38.42/22.45 [2019-03-28 12:38:18,334 INFO L130 ssoRankerPreferences]: Path of dumped script: 38.42/22.45 [2019-03-28 12:38:18,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 38.42/22.45 [2019-03-28 12:38:18,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 38.42/22.45 [2019-03-28 12:38:18,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 38.42/22.45 [2019-03-28 12:38:18,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,625 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 38.42/22.45 [2019-03-28 12:38:18,745 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 38.42/22.45 [2019-03-28 12:38:18,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:18,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.42/22.45 [2019-03-28 12:38:19,169 INFO L300 LassoAnalysis]: Preprocessing complete. 38.42/22.45 [2019-03-28 12:38:19,175 INFO L497 LassoAnalysis]: Using template 'affine'. 38.42/22.45 [2019-03-28 12:38:19,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.42/22.45 [2019-03-28 12:38:19,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.42/22.45 [2019-03-28 12:38:19,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.42/22.45 Termination analysis: LINEAR_WITH_GUESSES 38.42/22.45 Number of strict supporting invariants: 0 38.42/22.45 Number of non-strict supporting invariants: 1 38.42/22.45 Consider only non-deceasing supporting invariants: true 38.42/22.45 Simplify termination arguments: true 38.42/22.45 Simplify supporting invariants: trueOverapproximate stem: false 38.42/22.45 [2019-03-28 12:38:19,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.42/22.45 [2019-03-28 12:38:19,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.42/22.45 [2019-03-28 12:38:19,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.42/22.45 [2019-03-28 12:38:19,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.42/22.45 [2019-03-28 12:38:19,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.42/22.45 [2019-03-28 12:38:19,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.42/22.45 [2019-03-28 12:38:19,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 38.42/22.45 [2019-03-28 12:38:19,328 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 38.42/22.45 [2019-03-28 12:38:19,328 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. 38.42/22.45 [2019-03-28 12:38:19,331 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 38.42/22.45 [2019-03-28 12:38:19,332 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 38.42/22.45 [2019-03-28 12:38:19,332 INFO L518 LassoAnalysis]: Proved termination. 38.42/22.45 [2019-03-28 12:38:19,333 INFO L520 LassoAnalysis]: Termination argument consisting of: 38.42/22.45 Ranking function f(v_rep(select #length ULTIMATE.start_cstrcpy_~from.base)_1, ULTIMATE.start_cstrcpy_~from.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcpy_~from.base)_1 - 1*ULTIMATE.start_cstrcpy_~from.offset 38.42/22.45 Supporting invariants [] 38.42/22.45 [2019-03-28 12:38:19,380 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed 38.42/22.45 [2019-03-28 12:38:19,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.42/22.45 [2019-03-28 12:38:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:19,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:19,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:19,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:19,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.42/22.45 [2019-03-28 12:38:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.42/22.45 [2019-03-28 12:38:19,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core 38.42/22.45 [2019-03-28 12:38:19,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.42/22.45 [2019-03-28 12:38:19,501 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 38.42/22.45 [2019-03-28 12:38:19,505 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 38.42/22.45 [2019-03-28 12:38:19,506 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states. Second operand 3 states. 38.42/22.45 [2019-03-28 12:38:19,585 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states.. Second operand 3 states. Result 23 states and 49 transitions. Complement of second has 6 states. 38.42/22.45 [2019-03-28 12:38:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 38.42/22.45 [2019-03-28 12:38:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 38.42/22.45 [2019-03-28 12:38:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. 38.42/22.45 [2019-03-28 12:38:19,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 4 letters. 38.42/22.45 [2019-03-28 12:38:19,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. 38.42/22.45 [2019-03-28 12:38:19,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. 38.42/22.45 [2019-03-28 12:38:19,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. 38.42/22.45 [2019-03-28 12:38:19,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 8 letters. 38.42/22.45 [2019-03-28 12:38:19,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. 38.42/22.45 [2019-03-28 12:38:19,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 49 transitions. 38.42/22.45 [2019-03-28 12:38:19,598 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 38.42/22.45 [2019-03-28 12:38:19,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:19,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 38.42/22.45 [2019-03-28 12:38:19,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 38.42/22.45 [2019-03-28 12:38:19,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:19,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 38.42/22.45 [2019-03-28 12:38:19,600 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:19,601 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:19,601 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:19,601 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 38.42/22.45 [2019-03-28 12:38:19,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 38.42/22.45 [2019-03-28 12:38:19,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 38.42/22.45 [2019-03-28 12:38:19,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 38.42/22.45 [2019-03-28 12:38:19,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:19 BasicIcfg 38.42/22.45 [2019-03-28 12:38:19,608 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 38.42/22.45 [2019-03-28 12:38:19,609 INFO L168 Benchmark]: Toolchain (without parser) took 17999.24 ms. Allocated memory was 649.6 MB in the beginning and 843.1 MB in the end (delta: 193.5 MB). Free memory was 558.4 MB in the beginning and 640.8 MB in the end (delta: -82.4 MB). Peak memory consumption was 111.1 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,610 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.61 ms. Allocated memory was 649.6 MB in the beginning and 657.5 MB in the end (delta: 7.9 MB). Free memory was 558.4 MB in the beginning and 623.6 MB in the end (delta: -65.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.62 ms. Allocated memory is still 657.5 MB. Free memory was 623.6 MB in the beginning and 620.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,611 INFO L168 Benchmark]: Boogie Preprocessor took 25.88 ms. Allocated memory is still 657.5 MB. Free memory was 620.5 MB in the beginning and 619.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,611 INFO L168 Benchmark]: RCFGBuilder took 280.36 ms. Allocated memory is still 657.5 MB. Free memory was 619.1 MB in the beginning and 598.4 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,612 INFO L168 Benchmark]: BlockEncodingV2 took 114.80 ms. Allocated memory is still 657.5 MB. Free memory was 598.4 MB in the beginning and 590.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,612 INFO L168 Benchmark]: TraceAbstraction took 15421.54 ms. Allocated memory was 657.5 MB in the beginning and 753.9 MB in the end (delta: 96.5 MB). Free memory was 590.3 MB in the beginning and 534.9 MB in the end (delta: 55.3 MB). Peak memory consumption was 151.8 MB. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,613 INFO L168 Benchmark]: BuchiAutomizer took 1807.89 ms. Allocated memory was 753.9 MB in the beginning and 843.1 MB in the end (delta: 89.1 MB). Free memory was 534.9 MB in the beginning and 640.8 MB in the end (delta: -105.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 38.42/22.45 [2019-03-28 12:38:19,617 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 38.42/22.45 --- Results --- 38.42/22.45 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 38.42/22.45 - StatisticsResult: Initial Icfg 38.42/22.45 22 locations, 26 edges 38.42/22.45 - StatisticsResult: Encoded RCFG 38.42/22.45 15 locations, 27 edges 38.42/22.45 * Results from de.uni_freiburg.informatik.ultimate.core: 38.42/22.45 - StatisticsResult: Toolchain Benchmarks 38.42/22.45 Benchmark results are: 38.42/22.45 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 38.42/22.45 * CACSL2BoogieTranslator took 302.61 ms. Allocated memory was 649.6 MB in the beginning and 657.5 MB in the end (delta: 7.9 MB). Free memory was 558.4 MB in the beginning and 623.6 MB in the end (delta: -65.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 38.42/22.45 * Boogie Procedure Inliner took 40.62 ms. Allocated memory is still 657.5 MB. Free memory was 623.6 MB in the beginning and 620.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 38.42/22.45 * Boogie Preprocessor took 25.88 ms. Allocated memory is still 657.5 MB. Free memory was 620.5 MB in the beginning and 619.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 38.42/22.45 * RCFGBuilder took 280.36 ms. Allocated memory is still 657.5 MB. Free memory was 619.1 MB in the beginning and 598.4 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 38.42/22.45 * BlockEncodingV2 took 114.80 ms. Allocated memory is still 657.5 MB. Free memory was 598.4 MB in the beginning and 590.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 38.42/22.45 * TraceAbstraction took 15421.54 ms. Allocated memory was 657.5 MB in the beginning and 753.9 MB in the end (delta: 96.5 MB). Free memory was 590.3 MB in the beginning and 534.9 MB in the end (delta: 55.3 MB). Peak memory consumption was 151.8 MB. Max. memory is 50.3 GB. 38.42/22.45 * BuchiAutomizer took 1807.89 ms. Allocated memory was 753.9 MB in the beginning and 843.1 MB in the end (delta: 89.1 MB). Free memory was 534.9 MB in the beginning and 640.8 MB in the end (delta: -105.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 38.42/22.45 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #memory_int 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #memory_int 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #memory_int 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #memory_int 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #memory_int 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #memory_int 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 - GenericResult: Unfinished Backtranslation 38.42/22.45 unknown boogie variable #length 38.42/22.45 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 38.42/22.45 - PositiveResult [Line: 10]: pointer dereference always succeeds 38.42/22.45 For all program executions holds that pointer dereference always succeeds at this location 38.42/22.45 - PositiveResult [Line: 26]: pointer dereference always succeeds 38.42/22.45 For all program executions holds that pointer dereference always succeeds at this location 38.42/22.45 - PositiveResult [Line: 26]: pointer dereference always succeeds 38.42/22.45 For all program executions holds that pointer dereference always succeeds at this location 38.42/22.45 - PositiveResult [Line: 10]: pointer dereference always succeeds 38.42/22.45 For all program executions holds that pointer dereference always succeeds at this location 38.42/22.45 - PositiveResult [Line: 10]: pointer dereference always succeeds 38.42/22.45 For all program executions holds that pointer dereference always succeeds at this location 38.42/22.45 - PositiveResult [Line: 10]: pointer dereference always succeeds 38.42/22.45 For all program executions holds that pointer dereference always succeeds at this location 38.42/22.45 - AllSpecificationsHoldResult: All specifications hold 38.42/22.45 6 specifications checked. All of them hold 38.42/22.45 - InvariantResult [Line: 10]: Loop Invariant 38.42/22.45 [2019-03-28 12:38:19,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:19,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:19,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:19,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:19,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:19,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.42/22.45 [2019-03-28 12:38:19,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 [2019-03-28 12:38:19,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.42/22.45 Derived loop invariant: (((((((((((((((1 <= unknown-#length-unknown[to] && nondetArea == 0) && \valid[nondetArea] == 1) && 1 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[to]) && nondetString == 0) && 1 <= length1) && from == 0) && length2 + nondetString == 1) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[from]) && 0 == to) && 1 == \valid[from]) && 0 == unknown-#memory_int-unknown[from][from]) && length2 == unknown-#length-unknown[nondetString]) || ((((((((((((((((!(nondetString == nondetArea) && nondetArea == 0) && \valid[nondetArea] == 1) && !(to == from)) && 1 <= to) && unknown-#length-unknown[from] + to <= from + unknown-#length-unknown[to]) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1] == 0) && 1 == \valid[to]) && 1 <= length2) && nondetString == 0) && 1 <= from) && 1 <= length1) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[from]) && from + 1 <= unknown-#length-unknown[from]) && length2 == unknown-#length-unknown[nondetString])) || ((((((((((((((((!(nondetString == nondetArea) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && nondetArea == 0) && \valid[nondetArea] == 1) && !(to == from)) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1] == 0) && 1 == \valid[to]) && 1 <= length2) && nondetString == 0) && 1 <= length1) && from == 0) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[from]) && 0 == to) && from + 1 <= unknown-#length-unknown[from]) && length2 == unknown-#length-unknown[nondetString]) 38.42/22.45 - StatisticsResult: Ultimate Automizer benchmark data 38.42/22.45 CFG has 1 procedures, 15 locations, 6 error locations. SAFE Result, 15.3s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 415 SDslu, 292 SDs, 0 SdLazy, 789 SolverSat, 187 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=16, 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, 17 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 237 HoareAnnotationTreeSize, 1 FomulaSimplifications, 94 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 244 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 199 ConstructedInterpolants, 7 QuantifiedInterpolants, 17467 SizeOfPredicates, 50 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 11/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 38.42/22.45 - StatisticsResult: Constructed decomposition of program 38.42/22.45 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[from] + -1 * from and consists of 4 locations. 38.42/22.45 - StatisticsResult: Timing statistics 38.42/22.45 BüchiAutomizer plugin needed 1.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 7 SDtfs, 46 SDslu, 10 SDs, 0 SdLazy, 63 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax100 hnf100 lsp96 ukn90 mio100 lsp45 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 38.42/22.45 - TerminationAnalysisResult: Termination proven 38.42/22.45 Buchi Automizer proved that your program is terminating 38.42/22.45 RESULT: Ultimate proved your program to be correct! 38.42/22.45 !SESSION 2019-03-28 12:37:58.332 ----------------------------------------------- 38.42/22.45 eclipse.buildId=unknown 38.42/22.45 java.version=1.8.0_181 38.42/22.45 java.vendor=Oracle Corporation 38.42/22.45 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 38.42/22.45 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 38.42/22.45 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 38.42/22.45 38.42/22.45 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:19.866 38.42/22.45 !MESSAGE The workspace will exit with unsaved changes in this session. 38.42/22.45 Received shutdown request... 38.42/22.45 Ultimate: 38.42/22.45 GTK+ Version Check 38.42/22.45 EOF