java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:02:50,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:02:50,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:02:50,768 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:02:50,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:02:50,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:02:50,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:02:50,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:02:50,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:02:50,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:02:50,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:02:50,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:02:50,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:02:50,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:02:50,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:02:50,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:02:50,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:02:50,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:02:50,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:02:50,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:02:50,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:02:50,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:02:50,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:02:50,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:02:50,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:02:50,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:02:50,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:02:50,793 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:02:50,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:02:50,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:02:50,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:02:50,795 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-21 00:02:50,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:02:50,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:02:50,806 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:02:50,806 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:02:50,806 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:02:50,806 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:02:50,807 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:02:50,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:02:50,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:02:50,808 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:02:50,808 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:02:50,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:02:50,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:02:50,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:02:50,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:02:50,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:02:50,809 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:02:50,809 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:02:50,809 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:02:50,810 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:02:50,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:02:50,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:02:50,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:02:50,810 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:02:50,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:02:50,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:02:50,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:02:50,811 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:02:50,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:02:50,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:02:50,812 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:02:50,812 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:02:50,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:02:50,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:02:50,813 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:02:50,813 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:02:50,814 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:02:50,814 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:02:50,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:02:50,863 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:02:50,867 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:02:50,869 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:02:50,869 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:02:50,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-21 00:02:51,066 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:02:51,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:02:51,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:02:51,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:02:51,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:02:51,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65848b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51, skipping insertion in model container [2018-01-21 00:02:51,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,093 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:02:51,131 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:02:51,254 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:02:51,270 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:02:51,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51 WrapperNode [2018-01-21 00:02:51,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:02:51,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:02:51,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:02:51,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:02:51,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... [2018-01-21 00:02:51,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:02:51,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:02:51,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:02:51,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:02:51,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:02:51,359 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:02:51,360 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:02:51,360 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 00:02:51,360 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:02:51,360 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:02:51,360 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:02:51,360 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:02:51,361 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:02:51,361 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:02:51,361 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:02:51,361 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:02:51,361 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 00:02:51,361 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:02:51,362 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:02:51,362 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:02:51,362 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 00:02:51,362 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:02:51,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:02:51,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:02:51,589 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:02:51,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:02:51 BoogieIcfgContainer [2018-01-21 00:02:51,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:02:51,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:02:51,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:02:51,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:02:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:02:51" (1/3) ... [2018-01-21 00:02:51,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4765473e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:02:51, skipping insertion in model container [2018-01-21 00:02:51,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:02:51" (2/3) ... [2018-01-21 00:02:51,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4765473e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:02:51, skipping insertion in model container [2018-01-21 00:02:51,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:02:51" (3/3) ... [2018-01-21 00:02:51,596 INFO L105 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-21 00:02:51,602 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:02:51,608 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:02:51,655 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:02:51,655 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:02:51,655 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:02:51,655 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:02:51,655 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:02:51,656 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:02:51,656 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:02:51,656 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 00:02:51,657 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:02:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:02:51,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:02:51,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 57 states. [2018-01-21 00:02:51,758 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 00:02:51,759 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 623 625) no Hoare annotation was computed. [2018-01-21 00:02:51,759 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 623 625) the Hoare annotation is: true [2018-01-21 00:02:51,759 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 623 625) no Hoare annotation was computed. [2018-01-21 00:02:51,759 INFO L401 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-01-21 00:02:51,760 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 670) no Hoare annotation was computed. [2018-01-21 00:02:51,760 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 670) no Hoare annotation was computed. [2018-01-21 00:02:51,760 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 670) the Hoare annotation is: true [2018-01-21 00:02:51,760 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 670) no Hoare annotation was computed. [2018-01-21 00:02:51,761 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 670) the Hoare annotation is: true [2018-01-21 00:02:51,761 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 670) no Hoare annotation was computed. [2018-01-21 00:02:51,761 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 670) the Hoare annotation is: true [2018-01-21 00:02:51,761 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 670) no Hoare annotation was computed. [2018-01-21 00:02:51,761 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 670) no Hoare annotation was computed. [2018-01-21 00:02:51,762 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 00:02:51,762 INFO L401 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2018-01-21 00:02:51,762 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-21 00:02:51,762 INFO L401 ceAbstractionStarter]: For program point L664(line 664) no Hoare annotation was computed. [2018-01-21 00:02:51,762 INFO L401 ceAbstractionStarter]: For program point L661'''(lines 661 665) no Hoare annotation was computed. [2018-01-21 00:02:51,762 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 00:02:51,763 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 00:02:51,763 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-21 00:02:51,763 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-21 00:02:51,763 INFO L404 ceAbstractionStarter]: At program point L656(line 656) the Hoare annotation is: true [2018-01-21 00:02:51,763 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 00:02:51,764 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 670) no Hoare annotation was computed. [2018-01-21 00:02:51,764 INFO L401 ceAbstractionStarter]: For program point L651'(line 651) no Hoare annotation was computed. [2018-01-21 00:02:51,764 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-21 00:02:51,764 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-21 00:02:51,764 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-21 00:02:51,764 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 670) no Hoare annotation was computed. [2018-01-21 00:02:51,765 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 670) the Hoare annotation is: true [2018-01-21 00:02:51,765 INFO L401 ceAbstractionStarter]: For program point L648'(line 648) no Hoare annotation was computed. [2018-01-21 00:02:51,765 INFO L401 ceAbstractionStarter]: For program point L632'(lines 632 644) no Hoare annotation was computed. [2018-01-21 00:02:51,765 INFO L404 ceAbstractionStarter]: At program point L664'(line 664) the Hoare annotation is: true [2018-01-21 00:02:51,765 INFO L404 ceAbstractionStarter]: At program point L632'''(lines 632 644) the Hoare annotation is: true [2018-01-21 00:02:51,766 INFO L401 ceAbstractionStarter]: For program point L628'(line 628) no Hoare annotation was computed. [2018-01-21 00:02:51,766 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 00:02:51,766 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-21 00:02:51,766 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-21 00:02:51,766 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 00:02:51,767 INFO L401 ceAbstractionStarter]: For program point L632''''(lines 632 644) no Hoare annotation was computed. [2018-01-21 00:02:51,767 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 00:02:51,767 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 657) no Hoare annotation was computed. [2018-01-21 00:02:51,767 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 659) no Hoare annotation was computed. [2018-01-21 00:02:51,767 INFO L401 ceAbstractionStarter]: For program point L649''(lines 649 657) no Hoare annotation was computed. [2018-01-21 00:02:51,767 INFO L401 ceAbstractionStarter]: For program point L637'(line 637) no Hoare annotation was computed. [2018-01-21 00:02:51,768 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-21 00:02:51,768 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 670) no Hoare annotation was computed. [2018-01-21 00:02:51,768 INFO L401 ceAbstractionStarter]: For program point L648''''(lines 648 659) no Hoare annotation was computed. [2018-01-21 00:02:51,768 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 00:02:51,769 INFO L404 ceAbstractionStarter]: At program point L641'(line 641) the Hoare annotation is: true [2018-01-21 00:02:51,769 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 639) no Hoare annotation was computed. [2018-01-21 00:02:51,769 INFO L401 ceAbstractionStarter]: For program point L632(lines 632 644) no Hoare annotation was computed. [2018-01-21 00:02:51,769 INFO L401 ceAbstractionStarter]: For program point L661'(line 661) no Hoare annotation was computed. [2018-01-21 00:02:51,769 INFO L401 ceAbstractionStarter]: For program point L633''(lines 633 639) no Hoare annotation was computed. [2018-01-21 00:02:51,770 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 00:02:51,770 INFO L404 ceAbstractionStarter]: At program point L648'''(lines 648 659) the Hoare annotation is: true [2018-01-21 00:02:51,770 INFO L401 ceAbstractionStarter]: For program point L641'''(line 641) no Hoare annotation was computed. [2018-01-21 00:02:51,770 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-21 00:02:51,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:02:51,775 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:02:51,775 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:02:51,775 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:02:51,775 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:02:51,776 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:02:51,776 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:02:51,776 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:02:51,776 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:02:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:02:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:02:51,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:51,781 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:02:51,781 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:02:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash 150587, now seen corresponding path program 1 times [2018-01-21 00:02:51,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:51,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:51,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:51,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:51,813 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:02:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:02:51,871 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:02:51,877 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:02:51,882 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:02:51,883 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:02:51,883 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:02:51,883 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:02:51,883 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:02:51,883 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:02:51,884 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:02:51,884 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:02:51,884 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:02:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:02:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:02:51,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:51,889 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:02:51,889 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:02:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash -633884924, now seen corresponding path program 1 times [2018-01-21 00:02:51,890 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:51,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:51,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:51,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:51,892 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:02:51,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:02:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:02:52,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:02:52,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:02:52,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:02:52,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:02:52,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:02:52,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:02:52,043 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 00:02:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:02:52,060 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2018-01-21 00:02:52,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:02:52,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 00:02:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:02:52,068 INFO L225 Difference]: With dead ends: 85 [2018-01-21 00:02:52,069 INFO L226 Difference]: Without dead ends: 49 [2018-01-21 00:02:52,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:02:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-21 00:02:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-21 00:02:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-21 00:02:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-21 00:02:52,100 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2018-01-21 00:02:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:02:52,100 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-21 00:02:52,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:02:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-21 00:02:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:02:52,101 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:52,101 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:02:52,101 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:02:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash 10332939, now seen corresponding path program 1 times [2018-01-21 00:02:52,102 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:52,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:52,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,103 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:02:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:02:52,149 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:02:52,156 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:02:52,159 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:02:52,160 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:02:52,170 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:02:52,170 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:02:52,170 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:02:52,170 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:02:52,170 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:02:52,170 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:02:52,170 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:02:52,170 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:02:52,170 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:02:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:02:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:02:52,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:52,174 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:02:52,174 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:02:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 607160941, now seen corresponding path program 1 times [2018-01-21 00:02:52,174 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:52,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:52,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:02:52,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:02:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:02:52,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:02:52,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:02:52,204 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:02:52,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:02:52,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:02:52,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:02:52,205 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 00:02:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:02:52,211 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2018-01-21 00:02:52,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:02:52,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 00:02:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:02:52,213 INFO L225 Difference]: With dead ends: 85 [2018-01-21 00:02:52,213 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 00:02:52,213 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:02:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 00:02:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-21 00:02:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-21 00:02:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-21 00:02:52,220 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 19 [2018-01-21 00:02:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:02:52,220 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-21 00:02:52,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:02:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-21 00:02:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:02:52,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:52,222 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:02:52,222 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:02:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash -98313164, now seen corresponding path program 1 times [2018-01-21 00:02:52,222 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:52,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:52,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,224 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:02:52,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:02:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:02:52,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:02:52,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:02:52,455 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:02:52,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:02:52,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:02:52,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:02:52,456 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-01-21 00:02:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:02:52,690 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-21 00:02:52,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:02:52,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 00:02:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:02:52,692 INFO L225 Difference]: With dead ends: 90 [2018-01-21 00:02:52,692 INFO L226 Difference]: Without dead ends: 86 [2018-01-21 00:02:52,693 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:02:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-21 00:02:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2018-01-21 00:02:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-21 00:02:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-01-21 00:02:52,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 25 [2018-01-21 00:02:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:02:52,702 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-01-21 00:02:52,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:02:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-01-21 00:02:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:02:52,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:52,704 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:02:52,704 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:02:52,704 INFO L82 PathProgramCache]: Analyzing trace with hash 530147864, now seen corresponding path program 1 times [2018-01-21 00:02:52,704 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:52,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:52,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:52,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:02:52,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:02:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:02:52,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:02:52,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:02:52,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:02:52,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:02:52,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:02:52,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:02:52,790 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 7 states. [2018-01-21 00:02:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:02:52,996 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-21 00:02:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:02:52,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-21 00:02:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:02:52,998 INFO L225 Difference]: With dead ends: 121 [2018-01-21 00:02:52,998 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 00:02:52,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-21 00:02:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 00:02:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2018-01-21 00:02:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 00:02:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-01-21 00:02:53,005 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-01-21 00:02:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:02:53,005 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-01-21 00:02:53,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:02:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-01-21 00:02:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:02:53,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:02:53,006 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:02:53,006 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:02:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash 389018762, now seen corresponding path program 1 times [2018-01-21 00:02:53,007 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:02:53,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:53,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:02:53,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:02:53,008 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:02:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:02:53,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:02:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:02:53,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:02:53,377 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:02:53,378 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-21 00:02:53,380 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [26], [32], [33], [39], [41], [42], [43], [47], [48], [52], [54], [57], [83], [87], [89], [92], [101], [102], [105], [111], [112], [122], [123], [124] [2018-01-21 00:02:53,436 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:02:53,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:03:05,301 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:03:05,302 INFO L268 AbstractInterpreter]: Visited 35 different actions 52 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-21 00:03:05,314 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:03:05,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:03:05,314 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:03:05,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:03:05,320 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:03:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:03:05,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:03:05,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 00:03:05,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 00:03:05,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-21 00:03:05,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:03:05,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 00:03:05,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:03:05,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:03:05,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 00:03:05,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-21 00:03:05,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-01-21 00:03:05,664 INFO L477 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 10 treesize of output 9 [2018-01-21 00:03:05,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 00:03:05,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:03:05,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 29 [2018-01-21 00:03:05,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-21 00:03:05,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2018-01-21 00:03:05,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-01-21 00:03:05,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-21 00:03:05,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 00:03:05,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:03:05,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,848 INFO L267 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. [2018-01-21 00:03:05,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-21 00:03:05,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-21 00:03:05,981 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 00:03:05,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,986 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 00:03:05,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:05,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-01-21 00:03:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:06,018 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:03:06,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:03:06,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:03:06,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:03:06,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-01-21 00:03:06,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 25 [2018-01-21 00:03:06,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-21 00:03:06,287 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:03:06,287 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:03:06,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 00:03:06,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,290 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-21 00:03:06,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:03:06,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:03:06,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 16 [2018-01-21 00:03:06,310 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-21 00:03:06,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-21 00:03:06,328 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:45 [2018-01-21 00:03:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:06,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:03:06,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:03:06,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:03:06,438 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:03:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:03:06,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:03:06,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 00:03:06,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 00:03:06,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-21 00:03:06,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:03:06,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 00:03:06,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:03:06,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:03:06,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 00:03:06,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-21 00:03:06,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-01-21 00:03:06,521 INFO L477 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 10 treesize of output 9 [2018-01-21 00:03:06,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 00:03:06,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:03:06,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 29 [2018-01-21 00:03:06,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-21 00:03:06,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2018-01-21 00:03:06,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-01-21 00:03:06,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-21 00:03:06,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 00:03:06,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:03:06,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,586 INFO L267 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. [2018-01-21 00:03:06,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-21 00:03:06,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-21 00:03:06,611 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 00:03:06,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,616 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 00:03:06,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,622 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-01-21 00:03:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:06,625 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:03:06,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,680 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:03:06,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:03:06,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:03:06,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-01-21 00:03:06,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 25 [2018-01-21 00:03:06,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-21 00:03:06,767 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-21 00:03:06,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,769 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:03:06,769 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:03:06,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 00:03:06,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:03:06,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:03:06,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 16 [2018-01-21 00:03:06,789 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-21 00:03:06,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:03:06,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-21 00:03:06,806 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:45 [2018-01-21 00:03:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:06,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:03:06,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 14, 14] total 39 [2018-01-21 00:03:06,842 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:03:06,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-21 00:03:06,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-21 00:03:06,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1302, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 00:03:06,843 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 27 states. [2018-01-21 00:03:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:03:07,638 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2018-01-21 00:03:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 00:03:07,638 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-01-21 00:03:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:03:07,640 INFO L225 Difference]: With dead ends: 173 [2018-01-21 00:03:07,640 INFO L226 Difference]: Without dead ends: 165 [2018-01-21 00:03:07,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=555, Invalid=2525, Unknown=0, NotChecked=0, Total=3080 [2018-01-21 00:03:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-21 00:03:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 88. [2018-01-21 00:03:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-21 00:03:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-21 00:03:07,652 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 37 [2018-01-21 00:03:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:03:07,653 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-21 00:03:07,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-21 00:03:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-21 00:03:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:03:07,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:03:07,654 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:03:07,654 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 00:03:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1242791814, now seen corresponding path program 1 times [2018-01-21 00:03:07,655 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:03:07,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:03:07,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:03:07,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:03:07,656 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:03:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:03:07,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:03:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:07,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:03:07,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:03:07,701 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:03:07,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:03:07,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:03:07,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:03:07,702 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2018-01-21 00:03:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:03:07,716 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2018-01-21 00:03:07,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:03:07,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-01-21 00:03:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:03:07,718 INFO L225 Difference]: With dead ends: 187 [2018-01-21 00:03:07,718 INFO L226 Difference]: Without dead ends: 129 [2018-01-21 00:03:07,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:03:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-21 00:03:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2018-01-21 00:03:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-21 00:03:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-21 00:03:07,731 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 37 [2018-01-21 00:03:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:03:07,731 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-21 00:03:07,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:03:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-21 00:03:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 00:03:07,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:03:07,732 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:03:07,733 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 00:03:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1792818144, now seen corresponding path program 2 times [2018-01-21 00:03:07,733 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:03:07,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:03:07,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:03:07,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:03:07,734 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:03:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:03:07,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:03:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:07,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:03:07,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:03:07,769 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:03:07,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:03:07,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:03:07,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:03:07,770 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 3 states. [2018-01-21 00:03:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:03:07,821 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2018-01-21 00:03:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:03:07,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-21 00:03:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:03:07,822 INFO L225 Difference]: With dead ends: 207 [2018-01-21 00:03:07,822 INFO L226 Difference]: Without dead ends: 127 [2018-01-21 00:03:07,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:03:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-21 00:03:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-01-21 00:03:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-21 00:03:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-01-21 00:03:07,834 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 49 [2018-01-21 00:03:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:03:07,834 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-01-21 00:03:07,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:03:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-01-21 00:03:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 00:03:07,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:03:07,836 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:03:07,836 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 00:03:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1648376100, now seen corresponding path program 1 times [2018-01-21 00:03:07,837 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:03:07,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:03:07,837 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:03:07,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:03:07,838 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:03:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:03:07,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:03:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:03:08,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:03:08,385 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:03:08,386 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-21 00:03:08,386 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [26], [28], [29], [30], [32], [33], [39], [41], [42], [43], [47], [48], [52], [54], [57], [83], [87], [89], [92], [101], [102], [105], [111], [112], [122], [123], [124] [2018-01-21 00:03:08,387 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:03:08,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown