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_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:04:53,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:04:53,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:04:53,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:04:53,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:04:53,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:04:53,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:04:53,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:04:53,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:04:53,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:04:53,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:04:53,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:04:53,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:04:53,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:04:53,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:04:53,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:04:53,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:04:53,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:04:53,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:04:53,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:04:53,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:04:53,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:04:53,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:04:53,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:04:53,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:04:53,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:04:53,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:04:53,609 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:04:53,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:04:53,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:04:53,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:04:53,610 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_imprecise.epf [2018-01-21 01:04:53,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:04:53,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:04:53,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:04:53,622 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:04:53,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:04:53,623 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:04:53,623 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:04:53,623 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:04:53,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:04:53,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:04:53,624 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:04:53,624 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:04:53,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:04:53,625 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:04:53,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:04:53,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:04:53,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:04:53,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:04:53,626 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:04:53,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:04:53,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:04:53,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:04:53,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:04:53,627 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:04:53,627 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:04:53,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:04:53,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:04:53,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:04:53,628 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:04:53,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:04:53,628 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:04:53,628 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:04:53,628 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:04:53,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:04:53,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:04:53,629 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:04:53,629 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:04:53,630 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:04:53,630 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:04:53,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:04:53,680 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:04:53,684 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:04:53,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:04:53,686 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:04:53,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:53,872 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:04:53,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:04:53,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:53,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:04:53,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:04:53,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:53" (1/1) ... [2018-01-21 01:04:53,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a663d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:53, skipping insertion in model container [2018-01-21 01:04:53,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:53" (1/1) ... [2018-01-21 01:04:53,898 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:53,938 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:54,060 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:54,084 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:54,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54 WrapperNode [2018-01-21 01:04:54,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:54,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:04:54,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:04:54,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:04:54,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (1/1) ... [2018-01-21 01:04:54,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:04:54,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:04:54,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:04:54,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:04:54,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (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 01:04:54,189 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:04:54,189 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:04:54,189 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:04:54,189 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:04:54,190 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:04:54,191 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:04:54,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:04:54,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:04:54,526 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:04:54,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:54 BoogieIcfgContainer [2018-01-21 01:04:54,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:04:54,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:04:54,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:04:54,532 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:04:54,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:04:53" (1/3) ... [2018-01-21 01:04:54,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5891689b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:54, skipping insertion in model container [2018-01-21 01:04:54,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:54" (2/3) ... [2018-01-21 01:04:54,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5891689b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:54, skipping insertion in model container [2018-01-21 01:04:54,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:54" (3/3) ... [2018-01-21 01:04:54,538 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:54,547 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:04:54,556 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:04:54,600 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:54,601 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:54,601 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:54,601 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:54,601 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:54,601 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:54,601 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:54,601 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:04:54,602 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-21 01:04:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:04:54,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:54,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:04:54,627 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:04:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash 207316, now seen corresponding path program 1 times [2018-01-21 01:04:54,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:54,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:54,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:54,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:54,681 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:54,731 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:04:54,737 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:54,745 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:54,746 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:54,746 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:54,746 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:54,746 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:54,746 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:54,746 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:54,747 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:04:54,747 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-21 01:04:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 01:04:54,753 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:54,753 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 01:04:54,753 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1129106172, now seen corresponding path program 1 times [2018-01-21 01:04:54,753 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:54,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:54,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:54,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:54,756 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:54,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:54,920 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 01:04:54,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:54,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:04:54,922 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:54,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:04:54,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:04:54,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:04:54,942 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-21 01:04:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:54,966 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-01-21 01:04:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:04:54,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 01:04:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:54,978 INFO L225 Difference]: With dead ends: 123 [2018-01-21 01:04:54,978 INFO L226 Difference]: Without dead ends: 75 [2018-01-21 01:04:54,981 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 01:04:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-21 01:04:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-21 01:04:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-21 01:04:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-21 01:04:55,016 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 25 [2018-01-21 01:04:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:55,016 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-21 01:04:55,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:04:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-21 01:04:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 01:04:55,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:55,018 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:55,018 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:55,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1421482513, now seen corresponding path program 1 times [2018-01-21 01:04:55,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:55,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:55,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:55,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:55,020 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:55,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:55,183 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 01:04:55,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:55,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 01:04:55,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:55,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 01:04:55,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 01:04:55,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 01:04:55,187 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-01-21 01:04:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:55,522 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-21 01:04:55,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 01:04:55,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-21 01:04:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:55,527 INFO L225 Difference]: With dead ends: 133 [2018-01-21 01:04:55,527 INFO L226 Difference]: Without dead ends: 113 [2018-01-21 01:04:55,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-21 01:04:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-21 01:04:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-01-21 01:04:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-21 01:04:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-21 01:04:55,535 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 34 [2018-01-21 01:04:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:55,535 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-21 01:04:55,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 01:04:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-21 01:04:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 01:04:55,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:55,536 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-01-21 01:04:55,537 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1799396031, now seen corresponding path program 1 times [2018-01-21 01:04:55,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:55,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:55,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:55,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:55,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:55,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:55,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:55,666 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:55,667 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-21 01:04:55,669 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [168], [169], [170], [172], [173], [178], [179], [180], [181], [182] [2018-01-21 01:04:55,725 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:55,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:56,092 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 01:04:56,093 INFO L268 AbstractInterpreter]: Visited 34 different actions 50 times. Merged at 8 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-21 01:04:56,115 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 01:04:56,340 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 61.06% of their original sizes. [2018-01-21 01:04:56,340 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 01:04:56,937 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 01:04:56,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 01:04:56,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 26 [2018-01-21 01:04:56,938 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:56,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-21 01:04:56,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-21 01:04:56,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-21 01:04:56,939 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 19 states. [2018-01-21 01:05:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:00,882 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2018-01-21 01:05:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-21 01:05:00,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-01-21 01:05:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:00,884 INFO L225 Difference]: With dead ends: 163 [2018-01-21 01:05:00,884 INFO L226 Difference]: Without dead ends: 157 [2018-01-21 01:05:00,885 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-01-21 01:05:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-21 01:05:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 79. [2018-01-21 01:05:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 01:05:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-21 01:05:00,898 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 40 [2018-01-21 01:05:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:00,898 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-21 01:05:00,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-21 01:05:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-21 01:05:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:05:00,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:00,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:00,901 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash -225210580, now seen corresponding path program 1 times [2018-01-21 01:05:00,901 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:00,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:00,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:00,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:00,903 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:00,963 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:05:00,973 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:00,984 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:00,985 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:01,001 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:05:01,001 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:05:01,001 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:05:01,001 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:05:01,001 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:05:01,001 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:05:01,002 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:05:01,002 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:05:01,002 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:05:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-21 01:05:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 01:05:01,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:01,005 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] [2018-01-21 01:05:01,005 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:01,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1643515977, now seen corresponding path program 1 times [2018-01-21 01:05:01,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:01,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:01,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:01,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:01,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:01,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:01,028 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 01:05:01,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:01,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:05:01,028 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:01,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:05:01,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:05:01,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:05:01,029 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-21 01:05:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:01,034 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-01-21 01:05:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:05:01,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 01:05:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:01,035 INFO L225 Difference]: With dead ends: 123 [2018-01-21 01:05:01,035 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 01:05:01,036 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 01:05:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 01:05:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-21 01:05:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-21 01:05:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-21 01:05:01,041 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2018-01-21 01:05:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:01,042 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-21 01:05:01,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:05:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-21 01:05:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 01:05:01,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:01,043 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, 1, 1, 1, 1, 1] [2018-01-21 01:05:01,043 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash 144495766, now seen corresponding path program 1 times [2018-01-21 01:05:01,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:01,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:01,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:01,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:01,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:01,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:01,189 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 01:05:01,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:01,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 01:05:01,189 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:01,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 01:05:01,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 01:05:01,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 01:05:01,190 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2018-01-21 01:05:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:01,389 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-21 01:05:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 01:05:01,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-21 01:05:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:01,391 INFO L225 Difference]: With dead ends: 129 [2018-01-21 01:05:01,391 INFO L226 Difference]: Without dead ends: 111 [2018-01-21 01:05:01,392 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-21 01:05:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-21 01:05:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2018-01-21 01:05:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-21 01:05:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-21 01:05:01,398 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 32 [2018-01-21 01:05:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:01,398 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-21 01:05:01,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 01:05:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-21 01:05:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 01:05:01,400 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:01,400 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-21 01:05:01,400 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash -293099324, now seen corresponding path program 1 times [2018-01-21 01:05:01,400 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:01,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:01,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:01,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:01,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:01,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:01,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:01,490 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:01,490 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-21 01:05:01,490 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [168], [169], [171], [172], [173], [179], [180], [181] [2018-01-21 01:05:01,494 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:01,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:01,634 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 01:05:01,635 INFO L268 AbstractInterpreter]: Visited 34 different actions 50 times. Merged at 8 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-21 01:05:01,636 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 01:05:01,751 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 61.06% of their original sizes. [2018-01-21 01:05:01,752 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 01:05:02,263 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 01:05:02,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 01:05:02,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 26 [2018-01-21 01:05:02,263 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:02,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-21 01:05:02,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-21 01:05:02,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-21 01:05:02,264 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 19 states. [2018-01-21 01:05:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:05,178 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-01-21 01:05:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 01:05:05,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-01-21 01:05:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:05,180 INFO L225 Difference]: With dead ends: 159 [2018-01-21 01:05:05,180 INFO L226 Difference]: Without dead ends: 155 [2018-01-21 01:05:05,181 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-01-21 01:05:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-21 01:05:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 77. [2018-01-21 01:05:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-21 01:05:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-21 01:05:05,195 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 38 [2018-01-21 01:05:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:05,196 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-21 01:05:05,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-21 01:05:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-21 01:05:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 01:05:05,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:05,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:05,198 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1425462385, now seen corresponding path program 1 times [2018-01-21 01:05:05,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:05,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:05,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:05,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:05,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:05,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:05,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:05,671 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:05,671 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-01-21 01:05:05,671 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [147], [148], [159], [160], [161], [162], [163], [168], [169], [171], [172], [173], [179], [180], [181] [2018-01-21 01:05:05,673 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:05,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:05,861 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:05,861 INFO L268 AbstractInterpreter]: Visited 44 different actions 91 times. Merged at 19 different actions 42 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 35 variables. [2018-01-21 01:05:05,867 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:05,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:05,867 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 01:05:05,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:05,874 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:05,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:06,278 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:06,345 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 19 treesize of output 22 [2018-01-21 01:05:06,353 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 01:05:06,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:06,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:06,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:06,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:45 [2018-01-21 01:05:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:06,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:06,695 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 01:05:06,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:06,712 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:06,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:06,979 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 7 treesize of output 5 [2018-01-21 01:05:06,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 01:05:06,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:06,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:06,990 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 01:05:06,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-01-21 01:05:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:07,106 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:07,121 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 11 treesize of output 14 [2018-01-21 01:05:07,127 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 01:05:07,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:07,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-01-21 01:05:07,248 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 18 treesize of output 16 [2018-01-21 01:05:07,261 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 01:05:07,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,283 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 13 treesize of output 11 [2018-01-21 01:05:07,286 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 01:05:07,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,289 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 13 treesize of output 11 [2018-01-21 01:05:07,291 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 01:05:07,291 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:07,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:07,296 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-01-21 01:05:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:07,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:05:07,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 10, 10] total 40 [2018-01-21 01:05:07,889 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:05:07,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 01:05:07,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 01:05:07,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1426, Unknown=29, NotChecked=0, Total=1640 [2018-01-21 01:05:07,891 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 18 states. [2018-01-21 01:05:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:08,750 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-21 01:05:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 01:05:08,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-01-21 01:05:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:08,751 INFO L225 Difference]: With dead ends: 146 [2018-01-21 01:05:08,751 INFO L226 Difference]: Without dead ends: 142 [2018-01-21 01:05:08,752 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=339, Invalid=2182, Unknown=29, NotChecked=0, Total=2550 [2018-01-21 01:05:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-21 01:05:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2018-01-21 01:05:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-21 01:05:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-21 01:05:08,765 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 46 [2018-01-21 01:05:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:08,765 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-21 01:05:08,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 01:05:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-21 01:05:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:05:08,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:08,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:08,767 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1227318824, now seen corresponding path program 1 times [2018-01-21 01:05:08,767 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:08,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:08,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:08,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:08,769 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:08,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:08,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:08,963 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:08,964 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 01:05:08,964 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [147], [148], [151], [152], [153], [154], [155], [156], [157], [168], [169], [171], [172], [173], [179], [180], [181] [2018-01-21 01:05:08,967 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:08,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:09,215 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:09,216 INFO L268 AbstractInterpreter]: Visited 46 different actions 86 times. Merged at 21 different actions 36 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 37 variables. [2018-01-21 01:05:09,217 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:09,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:09,217 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:05:09,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:09,222 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:09,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:09,248 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 01:05:09,249 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 10 treesize of output 9 [2018-01-21 01:05:09,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-21 01:05:09,255 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 19 treesize of output 15 [2018-01-21 01:05:09,256 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 15 treesize of output 3 [2018-01-21 01:05:09,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,258 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 01:05:09,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-21 01:05:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:09,269 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:09,303 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 01:05:09,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-01-21 01:05:09,303 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:09,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:05:09,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:05:09,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-21 01:05:09,305 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 4 states. [2018-01-21 01:05:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:09,366 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-01-21 01:05:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 01:05:09,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-21 01:05:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:09,367 INFO L225 Difference]: With dead ends: 133 [2018-01-21 01:05:09,367 INFO L226 Difference]: Without dead ends: 115 [2018-01-21 01:05:09,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 01:05:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-21 01:05:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-01-21 01:05:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-21 01:05:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-01-21 01:05:09,382 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 48 [2018-01-21 01:05:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:09,382 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-01-21 01:05:09,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:05:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2018-01-21 01:05:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-21 01:05:09,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:09,384 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:09,384 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1924529378, now seen corresponding path program 2 times [2018-01-21 01:05:09,384 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:09,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:09,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:09,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:09,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:09,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:09,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:09,534 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:09,535 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 01:05:09,535 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 01:05:09,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:09,535 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:05:09,542 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:05:09,542 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:05:09,557 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:05:09,567 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:05:09,569 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:05:09,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:09,737 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 15 treesize of output 11 [2018-01-21 01:05:09,740 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 01:05:09,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:09,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-21 01:05:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:09,920 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:10,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 16 [2018-01-21 01:05:10,002 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 7 [2018-01-21 01:05:10,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-01-21 01:05:10,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:05:10,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:05:10,052 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-21 01:05:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:10,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:10,081 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:05:10,084 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:05:10,084 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:05:10,105 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:05:10,151 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:05:10,166 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:05:10,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:10,247 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 19 treesize of output 16 [2018-01-21 01:05:10,249 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 16 treesize of output 1 [2018-01-21 01:05:10,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:7 [2018-01-21 01:05:10,353 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 15 treesize of output 11 [2018-01-21 01:05:10,354 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 01:05:10,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:10,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-01-21 01:05:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:10,641 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:11,195 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 20 treesize of output 17 [2018-01-21 01:05:11,200 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 17 treesize of output 1 [2018-01-21 01:05:11,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:11,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:11,208 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 8 treesize of output 6 [2018-01-21 01:05:11,210 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 01:05:11,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:11,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:11,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:11,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:3 [2018-01-21 01:05:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:11,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:05:11,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11, 14, 13] total 44 [2018-01-21 01:05:11,226 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:05:11,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-21 01:05:11,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-21 01:05:11,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2018-01-21 01:05:11,227 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 21 states. [2018-01-21 01:05:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:12,291 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2018-01-21 01:05:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 01:05:12,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-01-21 01:05:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:12,292 INFO L225 Difference]: With dead ends: 219 [2018-01-21 01:05:12,293 INFO L226 Difference]: Without dead ends: 133 [2018-01-21 01:05:12,294 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=347, Invalid=3075, Unknown=0, NotChecked=0, Total=3422 [2018-01-21 01:05:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-21 01:05:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2018-01-21 01:05:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 01:05:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-01-21 01:05:12,306 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 54 [2018-01-21 01:05:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:12,306 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-01-21 01:05:12,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-21 01:05:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-01-21 01:05:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-21 01:05:12,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:12,308 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:12,308 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 828488614, now seen corresponding path program 1 times [2018-01-21 01:05:12,310 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:12,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:12,311 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 01:05:12,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:12,311 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:12,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:12,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:12,808 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:12,808 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-01-21 01:05:12,809 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [19], [20], [21], [22], [23], [24], [25], [28], [29], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [147], [148], [159], [160], [161], [162], [163], [168], [169], [171], [172], [173], [179], [180], [181] [2018-01-21 01:05:12,810 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:12,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:13,125 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:13,126 INFO L268 AbstractInterpreter]: Visited 53 different actions 152 times. Merged at 39 different actions 90 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 6 different actions. Largest state had 40 variables. [2018-01-21 01:05:13,135 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:13,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:13,135 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:05:13,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:13,143 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:13,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:13,165 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 01:05:13,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-21 01:05:13,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-01-21 01:05:13,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-21 01:05:13,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:13,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:13,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:13,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-21 01:05:13,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-01-21 01:05:13,285 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 01:05:13,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 01:05:13,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-21 01:05:13,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:13,350 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 35 treesize of output 36 [2018-01-21 01:05:13,351 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 8 treesize of output 7 [2018-01-21 01:05:13,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-21 01:05:13,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-01-21 01:05:13,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:13,389 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 30 treesize of output 18 [2018-01-21 01:05:13,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,397 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 1 xjuncts. [2018-01-21 01:05:13,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-01-21 01:05:13,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-21 01:05:13,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:05:13,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,441 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 01:05:13,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,445 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 01:05:13,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-21 01:05:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:13,478 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:13,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:05:13,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:05:13,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:05:13,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-01-21 01:05:13,694 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-21 01:05:13,707 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 9 treesize of output 8 [2018-01-21 01:05:13,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-01-21 01:05:13,728 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 28 treesize of output 31 [2018-01-21 01:05:13,749 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 18 treesize of output 5 [2018-01-21 01:05:13,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,751 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 01:05:13,752 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:05:13,793 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 19 treesize of output 13 [2018-01-21 01:05:13,793 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,796 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 18 treesize of output 12 [2018-01-21 01:05:13,796 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 33 [2018-01-21 01:05:13,848 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 25 treesize of output 19 [2018-01-21 01:05:13,849 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,852 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 26 treesize of output 14 [2018-01-21 01:05:13,852 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 01:05:13,878 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-21 01:05:13,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 26 [2018-01-21 01:05:13,887 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-21 01:05:13,905 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:05:13,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:05:13,931 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-01-21 01:05:13,934 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 19 treesize of output 13 [2018-01-21 01:05:13,935 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,953 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 13 treesize of output 7 [2018-01-21 01:05:13,954 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:13,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-01-21 01:05:13,971 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-21 01:05:13,982 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:14,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:05:14,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:05:14,045 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:42, output treesize:87 [2018-01-21 01:05:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:14,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:14,282 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:05:14,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:14,285 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:14,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:14,338 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 01:05:14,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 01:05:14,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-01-21 01:05:14,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-21 01:05:14,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:14,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:14,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:14,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-21 01:05:14,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-01-21 01:05:14,488 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 01:05:14,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 01:05:14,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-21 01:05:14,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:14,619 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 35 treesize of output 36 [2018-01-21 01:05:14,621 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 8 treesize of output 7 [2018-01-21 01:05:14,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-21 01:05:14,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-01-21 01:05:14,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:14,682 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 30 treesize of output 18 [2018-01-21 01:05:14,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,693 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 1 xjuncts. [2018-01-21 01:05:14,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-01-21 01:05:14,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-21 01:05:14,803 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 01:05:14,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:05:14,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:14,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-01-21 01:05:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:14,891 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:15,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:05:15,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:05:15,011 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 01:05:15,015 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 01:05:15,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 01:05:15,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:45 [2018-01-21 01:05:15,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-21 01:05:15,353 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 01:05:15,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,357 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 15 treesize of output 13 [2018-01-21 01:05:15,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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 01:05:15,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,367 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 15 treesize of output 13 [2018-01-21 01:05:15,369 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 6 treesize of output 1 [2018-01-21 01:05:15,369 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,372 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 15 treesize of output 13 [2018-01-21 01:05:15,373 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 6 treesize of output 1 [2018-01-21 01:05:15,373 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,375 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-21 01:05:15,397 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-01-21 01:05:27,390 WARN L143 SmtUtils]: Spent 8014ms on a formula simplification that was a NOOP. DAG size: 22 [2018-01-21 01:05:37,463 WARN L143 SmtUtils]: Spent 8014ms on a formula simplification that was a NOOP. DAG size: 22 [2018-01-21 01:05:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:05:37,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:05:37,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17, 16, 17] total 65 [2018-01-21 01:05:37,488 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:05:37,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-21 01:05:37,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-21 01:05:37,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3801, Unknown=2, NotChecked=0, Total=4160 [2018-01-21 01:05:37,489 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 29 states. [2018-01-21 01:05:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:38,999 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2018-01-21 01:05:38,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-21 01:05:38,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-01-21 01:05:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:39,000 INFO L225 Difference]: With dead ends: 201 [2018-01-21 01:05:39,001 INFO L226 Difference]: Without dead ends: 191 [2018-01-21 01:05:39,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=844, Invalid=5960, Unknown=2, NotChecked=0, Total=6806 [2018-01-21 01:05:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-21 01:05:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 150. [2018-01-21 01:05:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-21 01:05:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-01-21 01:05:39,017 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 57 [2018-01-21 01:05:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:39,018 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-01-21 01:05:39,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-21 01:05:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-01-21 01:05:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-21 01:05:39,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:39,019 INFO L322 BasicCegarLoop]: trace histogram [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, 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 01:05:39,019 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash 606504909, now seen corresponding path program 1 times [2018-01-21 01:05:39,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:39,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:39,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:39,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:39,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:39,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 01:05:39,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:39,455 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:39,455 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-01-21 01:05:39,456 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [19], [20], [21], [22], [23], [24], [25], [28], [29], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [147], [148], [151], [152], [153], [154], [155], [156], [157], [168], [169], [171], [172], [173], [179], [180], [181] [2018-01-21 01:05:39,460 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:39,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:39,960 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:39,961 INFO L268 AbstractInterpreter]: Visited 55 different actions 159 times. Merged at 41 different actions 96 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 42 variables. [2018-01-21 01:05:40,008 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:40,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:40,008 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:05:40,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:40,019 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:40,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:40,338 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 15 treesize of output 11 [2018-01-21 01:05:40,352 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 01:05:40,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-01-21 01:05:40,425 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 6 treesize of output 5 [2018-01-21 01:05:40,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-21 01:05:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 01:05:40,461 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:40,509 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 4 [2018-01-21 01:05:40,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,518 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 10 treesize of output 3 [2018-01-21 01:05:40,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:05:40,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:8 [2018-01-21 01:05:40,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-01-21 01:05:40,682 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 20 treesize of output 14 [2018-01-21 01:05:40,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,697 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 14 treesize of output 8 [2018-01-21 01:05:40,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:40,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2018-01-21 01:05:40,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 01:05:40,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:40,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:40,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:26 [2018-01-21 01:05:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 01:05:40,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:40,838 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 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 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:05:40,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:40,844 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:40,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:41,034 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 15 treesize of output 11 [2018-01-21 01:05:41,038 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 01:05:41,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-01-21 01:05:41,052 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 6 treesize of output 5 [2018-01-21 01:05:41,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-21 01:05:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 01:05:41,061 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:41,079 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 4 [2018-01-21 01:05:41,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,086 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 10 treesize of output 3 [2018-01-21 01:05:41,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:05:41,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:8 [2018-01-21 01:05:41,148 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 13 treesize of output 11 [2018-01-21 01:05:41,150 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 01:05:41,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-01-21 01:05:41,163 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 15 treesize of output 9 [2018-01-21 01:05:41,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,171 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 01:05:41,171 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-21 01:05:41,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:41,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:05:41,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:05:41,217 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-01-21 01:05:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 01:05:41,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:05:41,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 13, 11] total 28 [2018-01-21 01:05:41,231 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:05:41,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 01:05:41,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 01:05:41,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2018-01-21 01:05:41,232 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 13 states. [2018-01-21 01:05:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:41,715 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2018-01-21 01:05:41,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-21 01:05:41,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-01-21 01:05:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:41,717 INFO L225 Difference]: With dead ends: 228 [2018-01-21 01:05:41,717 INFO L226 Difference]: Without dead ends: 182 [2018-01-21 01:05:41,718 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 207 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2018-01-21 01:05:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-21 01:05:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 146. [2018-01-21 01:05:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-21 01:05:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-01-21 01:05:41,730 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 59 [2018-01-21 01:05:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:41,730 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-01-21 01:05:41,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 01:05:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-01-21 01:05:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-21 01:05:41,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:41,769 INFO L322 BasicCegarLoop]: trace histogram [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, 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 01:05:41,769 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1108780887, now seen corresponding path program 1 times [2018-01-21 01:05:41,769 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:41,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:41,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:41,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:41,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:41,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:42,187 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-01-21 01:05:42,371 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-01-21 01:05:42,558 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 19 DAG size of output 19 [2018-01-21 01:05:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:42,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:42,883 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:42,883 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-01-21 01:05:42,883 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [14], [17], [19], [20], [21], [22], [23], [24], [25], [31], [32], [33], [34], [35], [36], [37], [38], [43], [47], [52], [56], [64], [65], [70], [74], [82], [86], [88], [89], [132], [134], [135], [141], [145], [147], [148], [159], [160], [161], [162], [163], [168], [169], [171], [172], [173], [179], [180], [181] [2018-01-21 01:05:42,885 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:42,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:43,269 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:43,269 INFO L268 AbstractInterpreter]: Visited 59 different actions 163 times. Merged at 45 different actions 94 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 9 different actions. Largest state had 44 variables. [2018-01-21 01:05:43,275 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:43,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:43,276 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:05:43,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:43,282 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:43,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:43,314 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 01:05:43,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-21 01:05:43,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-01-21 01:05:43,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-21 01:05:43,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-01-21 01:05:43,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-01-21 01:05:43,501 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 01:05:43,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 01:05:43,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-01-21 01:05:43,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,604 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 44 treesize of output 45 [2018-01-21 01:05:43,607 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 8 treesize of output 7 [2018-01-21 01:05:43,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-21 01:05:43,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,659 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 59 treesize of output 58 [2018-01-21 01:05:43,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,662 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 14 [2018-01-21 01:05:43,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:50 [2018-01-21 01:05:43,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-21 01:05:43,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-01-21 01:05:43,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-01-21 01:05:43,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-21 01:05:43,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:52 [2018-01-21 01:05:43,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2018-01-21 01:05:43,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 01:05:43,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:43,910 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 1 xjuncts. [2018-01-21 01:05:43,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:75 [2018-01-21 01:05:43,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 84 [2018-01-21 01:05:43,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:05:43,995 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 38 treesize of output 22 [2018-01-21 01:05:43,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:05:44,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:05:44,040 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 01:05:44,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:72 Received shutdown request... [2018-01-21 01:05:44,302 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 01:05:44,302 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 01:05:44,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 01:05:44 BoogieIcfgContainer [2018-01-21 01:05:44,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 01:05:44,306 INFO L168 Benchmark]: Toolchain (without parser) took 50433.13 ms. Allocated memory was 297.8 MB in the beginning and 908.1 MB in the end (delta: 610.3 MB). Free memory was 256.7 MB in the beginning and 761.1 MB in the end (delta: -504.4 MB). Peak memory consumption was 105.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:44,307 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 297.8 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:05:44,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.44 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 244.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:44,307 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 ms. Allocated memory is still 297.8 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:44,308 INFO L168 Benchmark]: RCFGBuilder took 392.72 ms. Allocated memory is still 297.8 MB. Free memory was 242.7 MB in the beginning and 215.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:44,308 INFO L168 Benchmark]: TraceAbstraction took 49776.00 ms. Allocated memory was 297.8 MB in the beginning and 908.1 MB in the end (delta: 610.3 MB). Free memory was 215.7 MB in the beginning and 761.1 MB in the end (delta: -545.4 MB). Peak memory consumption was 64.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:44,310 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 297.8 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.44 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 244.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.62 ms. Allocated memory is still 297.8 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 392.72 ms. Allocated memory is still 297.8 MB. Free memory was 242.7 MB in the beginning and 215.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49776.00 ms. Allocated memory was 297.8 MB in the beginning and 908.1 MB in the end (delta: 610.3 MB). Free memory was 215.7 MB in the beginning and 761.1 MB in the end (delta: -545.4 MB). Peak memory consumption was 64.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 429 LocStat_NO_SUPPORTING_DISEQUALITIES : 113 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 40 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.102625 RENAME_VARIABLES(MILLISECONDS) : 0.954329 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.041963 PROJECTAWAY(MILLISECONDS) : 0.794321 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001610 DISJOIN(MILLISECONDS) : 1.349257 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.017041 ADD_EQUALITY(MILLISECONDS) : 0.021628 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020714 #CONJOIN_DISJUNCTIVE : 81 #RENAME_VARIABLES : 134 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 29 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 129 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 429 LocStat_NO_SUPPORTING_DISEQUALITIES : 113 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 40 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.628725 RENAME_VARIABLES(MILLISECONDS) : 0.598485 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.596975 PROJECTAWAY(MILLISECONDS) : 0.355649 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001055 DISJOIN(MILLISECONDS) : 0.820999 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.637228 ADD_EQUALITY(MILLISECONDS) : 0.006978 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010401 #CONJOIN_DISJUNCTIVE : 81 #RENAME_VARIABLES : 134 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 102 #ADD_WEAK_EQUALITY : 29 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 129 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 42 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 536 LocStat_NO_SUPPORTING_DISEQUALITIES : 146 LocStat_NO_DISJUNCTIONS : -84 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 90 TransStat_NO_SUPPORTING_DISEQUALITIES : 21 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.202393 RENAME_VARIABLES(MILLISECONDS) : 0.219227 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.187614 PROJECTAWAY(MILLISECONDS) : 0.350373 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002389 DISJOIN(MILLISECONDS) : 0.523475 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.239049 ADD_EQUALITY(MILLISECONDS) : 0.011045 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009256 #CONJOIN_DISJUNCTIVE : 147 #RENAME_VARIABLES : 285 #UNFREEZE : 0 #CONJOIN : 266 #PROJECTAWAY : 187 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 251 #ADD_EQUALITY : 92 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 44 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 564 LocStat_NO_SUPPORTING_DISEQUALITIES : 148 LocStat_NO_DISJUNCTIONS : -88 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 50 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 107 TransStat_NO_SUPPORTING_DISEQUALITIES : 22 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.289841 RENAME_VARIABLES(MILLISECONDS) : 0.319134 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.273224 PROJECTAWAY(MILLISECONDS) : 0.194371 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001645 DISJOIN(MILLISECONDS) : 0.721171 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.341063 ADD_EQUALITY(MILLISECONDS) : 0.015261 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009483 #CONJOIN_DISJUNCTIVE : 146 #RENAME_VARIABLES : 280 #UNFREEZE : 0 #CONJOIN : 289 #PROJECTAWAY : 194 #ADD_WEAK_EQUALITY : 32 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 245 #ADD_EQUALITY : 101 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 590 LocStat_NO_SUPPORTING_DISEQUALITIES : 213 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 57 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 27 TransStat_NO_DISJUNCTIONS : 66 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.284410 RENAME_VARIABLES(MILLISECONDS) : 0.299244 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.266395 PROJECTAWAY(MILLISECONDS) : 0.413700 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.006409 DISJOIN(MILLISECONDS) : 0.738422 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.321206 ADD_EQUALITY(MILLISECONDS) : 0.017592 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008859 #CONJOIN_DISJUNCTIVE : 253 #RENAME_VARIABLES : 496 #UNFREEZE : 0 #CONJOIN : 400 #PROJECTAWAY : 289 #ADD_WEAK_EQUALITY : 51 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 449 #ADD_EQUALITY : 118 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 52 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 620 LocStat_NO_SUPPORTING_DISEQUALITIES : 214 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 59 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 28 TransStat_NO_DISJUNCTIONS : 71 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.458044 RENAME_VARIABLES(MILLISECONDS) : 0.562906 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.428171 PROJECTAWAY(MILLISECONDS) : 0.350480 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000960 DISJOIN(MILLISECONDS) : 0.766191 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.596874 ADD_EQUALITY(MILLISECONDS) : 0.020132 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009977 #CONJOIN_DISJUNCTIVE : 262 #RENAME_VARIABLES : 515 #UNFREEZE : 0 #CONJOIN : 437 #PROJECTAWAY : 315 #ADD_WEAK_EQUALITY : 52 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 463 #ADD_EQUALITY : 127 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 56 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 698 LocStat_NO_SUPPORTING_DISEQUALITIES : 264 LocStat_NO_DISJUNCTIONS : -112 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 63 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 117 TransStat_NO_SUPPORTING_DISEQUALITIES : 30 TransStat_NO_DISJUNCTIONS : 72 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.982227 RENAME_VARIABLES(MILLISECONDS) : 0.256004 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.237296 PROJECTAWAY(MILLISECONDS) : 0.072228 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000597 DISJOIN(MILLISECONDS) : 0.870573 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.281209 ADD_EQUALITY(MILLISECONDS) : 0.015002 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009155 #CONJOIN_DISJUNCTIVE : 270 #RENAME_VARIABLES : 519 #UNFREEZE : 0 #CONJOIN : 433 #PROJECTAWAY : 320 #ADD_WEAK_EQUALITY : 71 #DISJOIN : 38 #RENAME_VARIABLES_DISJUNCTIVE : 471 #ADD_EQUALITY : 145 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={13:0}] [L994] SLL* null = malloc(sizeof(SLL)); VAL [malloc(sizeof(SLL))={13:0}, null={13:0}] [L995] FCALL null->colour = BLACK VAL [malloc(sizeof(SLL))={13:0}, null={13:0}] [L996] FCALL null->next = ((void*)0) VAL [malloc(sizeof(SLL))={13:0}, null={13:0}] [L998] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L998] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L999] FCALL list->next = null VAL [list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1000] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1002] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1030] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1031] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1033] COND TRUE null != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1035] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR, FCALL end->next VAL [end={12:0}, end->next={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1042] end = end->next [L1033] COND FALSE !(null != end) VAL [end={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1046] COND TRUE null != list VAL [end={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1048] EXPR, FCALL list->colour VAL [end={13:0}, list={12:0}, list->colour=1, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1048] COND FALSE !(RED == list->colour) [L1057] EXPR, FCALL list->next VAL [end={13:0}, list={12:0}, list->next={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1057] end = list->next [L1058] FCALL free(list) VAL [end={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1059] list = end VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1046] COND FALSE !(null != list) VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1063] FCALL free(null) VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1065] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. UNSAFE Result, 6.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 996 SDslu, 416 SDs, 0 SdLazy, 577 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9668368380937108 AbsIntWeakeningRatio, 0.5641025641025641 AbsIntAvgWeakeningVarsNumRemoved, 6.358974358974359 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 114 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 9054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. TIMEOUT Result, 43.3s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 486 SDtfs, 3073 SDslu, 2529 SDs, 0 SdLazy, 2839 SolverSat, 294 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1146 GetRequests, 823 SyntacticMatches, 43 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4392 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.965044234747425 AbsIntWeakeningRatio, 0.5675675675675675 AbsIntAvgWeakeningVarsNumRemoved, 6.702702702702703 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 259 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 837 NumberOfCodeBlocks, 837 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1291 ConstructedInterpolants, 87 QuantifiedInterpolants, 834120 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1458 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 55/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-05-44-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_01-05-44-328.csv Completed graceful shutdown