java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:23:26,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:23:26,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:23:26,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:23:26,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:23:26,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:23:26,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:23:26,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:23:26,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:23:26,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:23:26,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:23:26,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:23:26,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:23:26,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:23:26,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:23:26,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:23:26,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:23:26,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:23:26,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:23:26,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:23:26,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:23:26,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:23:26,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:23:26,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:23:26,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:23:26,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:23:26,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:23:26,608 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:23:26,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:23:26,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:23:26,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:23:26,609 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:23:26,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:23:26,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:23:26,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:23:26,620 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:23:26,620 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:23:26,620 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:23:26,621 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:23:26,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:23:26,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:23:26,622 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:23:26,622 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:23:26,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:23:26,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:23:26,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:23:26,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:23:26,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:23:26,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:23:26,623 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:23:26,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:23:26,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:23:26,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:23:26,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:23:26,624 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:23:26,624 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:23:26,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:23:26,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:23:26,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:23:26,625 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:23:26,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:23:26,625 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:23:26,625 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:23:26,625 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:23:26,626 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:23:26,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:23:26,626 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:23:26,626 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:23:26,627 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:23:26,627 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:23:26,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:23:26,675 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:23:26,679 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:23:26,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:23:26,681 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:23:26,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-20 23:23:26,838 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:23:26,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:23:26,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:23:26,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:23:26,852 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:23:26,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:23:26" (1/1) ... [2018-01-20 23:23:26,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7344226a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:26, skipping insertion in model container [2018-01-20 23:23:26,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:23:26" (1/1) ... [2018-01-20 23:23:26,877 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:23:26,918 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:23:27,054 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:23:27,070 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:23:27,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27 WrapperNode [2018-01-20 23:23:27,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:23:27,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:23:27,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:23:27,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:23:27,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (1/1) ... [2018-01-20 23:23:27,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:23:27,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:23:27,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:23:27,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:23:27,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (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-20 23:23:27,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:23:27,181 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:23:27,181 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:23:27,181 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:23:27,181 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:23:27,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:23:27,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:23:27,181 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:23:27,182 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:23:27,182 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:23:27,182 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:23:27,182 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:23:27,411 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:23:27,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:23:27 BoogieIcfgContainer [2018-01-20 23:23:27,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:23:27,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:23:27,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:23:27,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:23:27,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:23:26" (1/3) ... [2018-01-20 23:23:27,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dad8ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:23:27, skipping insertion in model container [2018-01-20 23:23:27,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:27" (2/3) ... [2018-01-20 23:23:27,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dad8ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:23:27, skipping insertion in model container [2018-01-20 23:23:27,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:23:27" (3/3) ... [2018-01-20 23:23:27,419 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-20 23:23:27,427 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:23:27,435 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 23:23:27,484 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:27,484 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:27,484 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:27,484 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:27,484 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:27,484 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:27,485 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:27,485 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:23:27,486 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:23:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:23:27,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:27,513 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:23:27,514 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:23:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-20 23:23:27,522 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:27,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:27,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:27,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:27,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:27,641 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:23:27,648 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:27,656 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:27,657 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:27,657 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:27,657 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:27,657 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:27,657 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:27,657 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:27,657 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:23:27,658 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:23:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:23:27,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:27,662 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] [2018-01-20 23:23:27,662 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-20 23:23:27,663 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:27,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:27,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:27,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:27,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:27,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:27,743 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-20 23:23:27,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:27,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:23:27,746 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:27,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:23:27,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:23:27,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:27,856 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 23:23:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:27,873 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-20 23:23:27,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:23:27,875 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 23:23:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:27,886 INFO L225 Difference]: With dead ends: 70 [2018-01-20 23:23:27,886 INFO L226 Difference]: Without dead ends: 42 [2018-01-20 23:23:27,888 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-20 23:23:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-20 23:23:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-20 23:23:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-20 23:23:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-20 23:23:27,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-20 23:23:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:27,926 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-20 23:23:27,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:23:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-20 23:23:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:23:27,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:27,927 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-20 23:23:27,927 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-20 23:23:27,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:27,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:27,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:27,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:27,929 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:27,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:28,088 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-20 23:23:28,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:28,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:23:28,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:28,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:23:28,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:23:28,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:23:28,092 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-20 23:23:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:28,134 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-20 23:23:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:23:28,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 23:23:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:28,139 INFO L225 Difference]: With dead ends: 109 [2018-01-20 23:23:28,139 INFO L226 Difference]: Without dead ends: 75 [2018-01-20 23:23:28,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:23:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-20 23:23:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-20 23:23:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 23:23:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 23:23:28,149 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-20 23:23:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:28,149 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 23:23:28,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:23:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 23:23:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:23:28,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:28,151 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-20 23:23:28,151 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:28,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-20 23:23:28,151 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:28,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:28,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:28,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:28,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:28,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:28,217 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-20 23:23:28,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:28,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:23:28,218 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:28,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:23:28,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:23:28,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:23:28,219 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 23:23:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:28,285 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-20 23:23:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:23:28,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-20 23:23:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:28,286 INFO L225 Difference]: With dead ends: 75 [2018-01-20 23:23:28,287 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 23:23:28,287 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:23:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 23:23:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-20 23:23:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 23:23:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-20 23:23:28,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-20 23:23:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:28,294 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-20 23:23:28,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:23:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-20 23:23:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 23:23:28,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:28,296 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] [2018-01-20 23:23:28,296 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-20 23:23:28,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:28,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:28,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:28,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:28,297 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:28,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:28,730 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 64 DAG size of output 32 [2018-01-20 23:23:28,875 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-20 23:23:29,078 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-20 23:23:29,274 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 62 DAG size of output 36 [2018-01-20 23:23:29,444 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-20 23:23:29,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:29,444 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:29,445 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-20 23:23:29,446 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [10], [18], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [61], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-20 23:23:29,496 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:23:29,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:23:32,157 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:23:32,159 INFO L268 AbstractInterpreter]: Visited 29 different actions 47 times. Merged at 17 different actions 17 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-20 23:23:32,168 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:23:32,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:32,169 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-20 23:23:32,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:32,181 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:32,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:32,334 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 34 treesize of output 29 [2018-01-20 23:23:32,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:32,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 34 [2018-01-20 23:23:32,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,358 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 35 treesize of output 30 [2018-01-20 23:23:32,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:32,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 34 [2018-01-20 23:23:32,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 23:23:32,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-20 23:23:32,526 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 30 treesize of output 24 [2018-01-20 23:23:32,531 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 24 treesize of output 16 [2018-01-20 23:23:32,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-20 23:23:32,559 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-20 23:23:32,559 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:32,713 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 36 treesize of output 32 [2018-01-20 23:23:32,731 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 20 treesize of output 14 [2018-01-20 23:23:32,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,734 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 16 treesize of output 11 [2018-01-20 23:23:32,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:32,754 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 35 treesize of output 31 [2018-01-20 23:23:32,772 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 20 treesize of output 14 [2018-01-20 23:23:32,773 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,775 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 16 treesize of output 11 [2018-01-20 23:23:32,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:32,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:32,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-20 23:23:32,795 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:72, output treesize:41 [2018-01-20 23:23:32,850 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-20 23:23:32,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:32,873 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-20 23:23:32,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:32,877 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:32,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:32,982 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 23:23:32,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,000 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 27 treesize of output 22 [2018-01-20 23:23:33,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:33,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 34 [2018-01-20 23:23:33,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 23:23:33,020 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:29 [2018-01-20 23:23:33,098 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 29 treesize of output 23 [2018-01-20 23:23:33,100 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 23 treesize of output 15 [2018-01-20 23:23:33,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,107 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-20 23:23:33,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:4 [2018-01-20 23:23:33,116 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-20 23:23:33,117 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:33,145 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 36 treesize of output 32 [2018-01-20 23:23:33,160 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 16 treesize of output 11 [2018-01-20 23:23:33,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-20 23:23:33,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:33,183 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 35 treesize of output 31 [2018-01-20 23:23:33,199 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 16 treesize of output 11 [2018-01-20 23:23:33,199 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,201 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 20 treesize of output 14 [2018-01-20 23:23:33,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:33,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:33,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 23:23:33,218 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2018-01-20 23:23:33,242 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-20 23:23:33,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:23:33,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 11, 10] total 27 [2018-01-20 23:23:33,245 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:23:33,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 23:23:33,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 23:23:33,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-01-20 23:23:33,247 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 17 states. [2018-01-20 23:23:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:33,991 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-20 23:23:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 23:23:33,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-01-20 23:23:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:33,993 INFO L225 Difference]: With dead ends: 102 [2018-01-20 23:23:33,993 INFO L226 Difference]: Without dead ends: 81 [2018-01-20 23:23:33,994 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-01-20 23:23:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-20 23:23:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-20 23:23:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 23:23:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-20 23:23:34,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-20 23:23:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:34,002 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-20 23:23:34,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 23:23:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-20 23:23:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 23:23:34,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:34,003 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] [2018-01-20 23:23:34,003 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-20 23:23:34,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:34,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:34,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:34,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:34,005 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:34,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:23:34,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:34,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-20 23:23:34,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:34,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 23:23:34,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 23:23:34,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-20 23:23:34,180 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-20 23:23:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:34,371 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-20 23:23:34,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 23:23:34,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-20 23:23:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:34,372 INFO L225 Difference]: With dead ends: 128 [2018-01-20 23:23:34,372 INFO L226 Difference]: Without dead ends: 121 [2018-01-20 23:23:34,373 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-01-20 23:23:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-20 23:23:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-20 23:23:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-20 23:23:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-20 23:23:34,380 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-20 23:23:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:34,380 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-20 23:23:34,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 23:23:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-20 23:23:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 23:23:34,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:34,381 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] [2018-01-20 23:23:34,381 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-20 23:23:34,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:34,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:34,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:34,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:34,382 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:34,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:34,430 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-20 23:23:34,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:34,430 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:34,430 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-20 23:23:34,430 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [12], [16], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [57], [58], [59], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-20 23:23:34,432 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:23:34,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:23:36,213 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:23:36,214 INFO L268 AbstractInterpreter]: Visited 31 different actions 51 times. Merged at 19 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-01-20 23:23:36,218 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:23:36,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:36,218 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-20 23:23:36,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:36,227 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:36,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:36,287 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-20 23:23:36,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:36,312 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-20 23:23:36,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:36,333 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:23:36,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:36,336 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:36,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:36,363 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-20 23:23:36,363 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:36,388 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-20 23:23:36,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:23:36,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-20 23:23:36,390 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:23:36,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 23:23:36,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 23:23:36,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-20 23:23:36,391 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-20 23:23:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:36,501 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-20 23:23:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 23:23:36,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-20 23:23:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:36,503 INFO L225 Difference]: With dead ends: 185 [2018-01-20 23:23:36,503 INFO L226 Difference]: Without dead ends: 156 [2018-01-20 23:23:36,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-20 23:23:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-20 23:23:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-20 23:23:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-20 23:23:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-20 23:23:36,516 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-20 23:23:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:36,516 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-20 23:23:36,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 23:23:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-20 23:23:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 23:23:36,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:36,517 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] [2018-01-20 23:23:36,517 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-20 23:23:36,518 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:36,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:36,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:36,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:36,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:36,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:36,770 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-20 23:23:36,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:36,771 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:36,771 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-20 23:23:36,771 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [12], [18], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [57], [58], [59], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-20 23:23:36,772 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:23:36,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:23:38,201 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:23:38,201 INFO L268 AbstractInterpreter]: Visited 31 different actions 51 times. Merged at 19 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-20 23:23:38,202 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:23:38,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:38,203 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 23:23:38,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:38,208 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:38,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:38,280 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 23:23:38,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,283 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 40 treesize of output 35 [2018-01-20 23:23:38,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:38,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 34 [2018-01-20 23:23:38,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,310 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-20 23:23:38,358 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 33 treesize of output 27 [2018-01-20 23:23:38,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:38,362 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:38,362 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 27 treesize of output 26 [2018-01-20 23:23:38,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,372 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-20 23:23:38,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-20 23:23:38,380 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-20 23:23:38,381 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:38,534 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 35 treesize of output 31 [2018-01-20 23:23:38,549 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 21 treesize of output 16 [2018-01-20 23:23:38,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,551 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 22 treesize of output 16 [2018-01-20 23:23:38,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:38,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:38,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-01-20 23:23:38,601 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-20 23:23:38,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:38,622 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:23:38,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:38,625 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:38,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:38,710 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 23:23:38,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,726 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 18 treesize of output 15 [2018-01-20 23:23:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-01-20 23:23:38,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,735 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:24 [2018-01-20 23:23:38,918 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 33 treesize of output 27 [2018-01-20 23:23:38,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:38,922 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:38,922 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 27 treesize of output 26 [2018-01-20 23:23:38,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:38,947 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-20 23:23:38,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-20 23:23:38,957 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-20 23:23:38,957 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:39,101 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 61 treesize of output 55 [2018-01-20 23:23:39,123 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 18 treesize of output 16 [2018-01-20 23:23:39,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,124 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 17 treesize of output 12 [2018-01-20 23:23:39,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,129 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 64 treesize of output 58 [2018-01-20 23:23:39,153 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 17 treesize of output 12 [2018-01-20 23:23:39,153 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,157 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 18 treesize of output 16 [2018-01-20 23:23:39,157 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,201 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 58 treesize of output 52 [2018-01-20 23:23:39,223 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 17 treesize of output 12 [2018-01-20 23:23:39,223 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,224 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 18 treesize of output 16 [2018-01-20 23:23:39,225 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,230 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,251 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 46 treesize of output 42 [2018-01-20 23:23:39,276 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 18 treesize of output 16 [2018-01-20 23:23:39,276 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,278 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 17 treesize of output 12 [2018-01-20 23:23:39,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,284 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,303 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 47 treesize of output 43 [2018-01-20 23:23:39,326 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 17 treesize of output 12 [2018-01-20 23:23:39,327 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,328 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 18 treesize of output 16 [2018-01-20 23:23:39,328 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,332 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:39,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:39,350 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:434, output treesize:40 [2018-01-20 23:23:39,482 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-20 23:23:39,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:23:39,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 39 [2018-01-20 23:23:39,484 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:23:39,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-20 23:23:39,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-20 23:23:39,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 23:23:39,485 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-20 23:23:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:40,241 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-20 23:23:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 23:23:40,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-20 23:23:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:40,242 INFO L225 Difference]: With dead ends: 234 [2018-01-20 23:23:40,242 INFO L226 Difference]: Without dead ends: 227 [2018-01-20 23:23:40,243 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=696, Invalid=2964, Unknown=0, NotChecked=0, Total=3660 [2018-01-20 23:23:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-20 23:23:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-20 23:23:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-20 23:23:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-20 23:23:40,255 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-20 23:23:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:40,256 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-20 23:23:40,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-20 23:23:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-20 23:23:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 23:23:40,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:40,257 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] [2018-01-20 23:23:40,258 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-20 23:23:40,258 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:40,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:40,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:40,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:40,259 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:40,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:40,827 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 71 DAG size of output 42 [2018-01-20 23:23:41,347 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-20 23:23:41,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:41,347 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:41,348 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-20 23:23:41,348 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [10], [18], [20], [21], [25], [28], [30], [31], [34], [35], [36], [37], [38], [42], [46], [47], [51], [53], [54], [61], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-20 23:23:41,349 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:23:41,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:23:43,998 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:23:43,998 INFO L268 AbstractInterpreter]: Visited 33 different actions 77 times. Merged at 21 different actions 42 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-20 23:23:44,003 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:23:44,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:44,003 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 23:23:44,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:44,008 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:44,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:44,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:44,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-20 23:23:44,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-20 23:23:44,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,137 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-20 23:23:44,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-20 23:23:44,159 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 23:23:44,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,184 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 26 treesize of output 21 [2018-01-20 23:23:44,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:44,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:44,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 41 [2018-01-20 23:23:44,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 23:23:44,206 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-20 23:23:44,266 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 29 treesize of output 23 [2018-01-20 23:23:44,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:44,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:44,270 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 23 treesize of output 22 [2018-01-20 23:23:44,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-20 23:23:44,292 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-20 23:23:44,292 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:44,626 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 54 treesize of output 48 [2018-01-20 23:23:44,628 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:44,629 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-20 23:23:44,635 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 23 treesize of output 10 [2018-01-20 23:23:44,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,637 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:44,637 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:44,637 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 18 treesize of output 16 [2018-01-20 23:23:44,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:44,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:44,667 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 55 treesize of output 49 [2018-01-20 23:23:44,669 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:44,670 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-20 23:23:44,686 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 23 treesize of output 10 [2018-01-20 23:23:44,687 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,688 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:44,688 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:44,688 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 18 treesize of output 16 [2018-01-20 23:23:44,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:44,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:44,700 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:44,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-20 23:23:44,718 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:110, output treesize:61 [2018-01-20 23:23:44,794 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-20 23:23:44,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:44,813 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:23:44,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:44,816 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:44,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:45,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-01-20 23:23:45,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,028 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 28 treesize of output 19 [2018-01-20 23:23:45,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-01-20 23:23:45,067 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 38 treesize of output 33 [2018-01-20 23:23:45,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 43 [2018-01-20 23:23:45,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,081 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 39 treesize of output 34 [2018-01-20 23:23:45,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 43 [2018-01-20 23:23:45,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 23:23:45,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:30 [2018-01-20 23:23:45,187 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 28 treesize of output 22 [2018-01-20 23:23:45,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:23:45,191 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 22 treesize of output 18 [2018-01-20 23:23:45,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,199 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-20 23:23:45,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2018-01-20 23:23:45,227 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-20 23:23:45,227 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:45,523 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 53 treesize of output 47 [2018-01-20 23:23:45,525 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:45,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-01-20 23:23:45,540 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 21 treesize of output 10 [2018-01-20 23:23:45,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,541 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:45,542 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:45,542 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 17 treesize of output 7 [2018-01-20 23:23:45,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:45,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:45,565 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 54 treesize of output 48 [2018-01-20 23:23:45,567 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:45,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-01-20 23:23:45,581 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 21 treesize of output 10 [2018-01-20 23:23:45,582 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:45,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 23:23:45,584 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 17 treesize of output 7 [2018-01-20 23:23:45,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 23:23:45,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:45,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:23:45,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 23:23:45,603 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:41 [2018-01-20 23:23:45,637 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-20 23:23:45,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:23:45,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13, 14, 13] total 51 [2018-01-20 23:23:45,639 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:23:45,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-20 23:23:45,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-20 23:23:45,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2018-01-20 23:23:45,641 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 26 states. [2018-01-20 23:23:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:47,512 INFO L93 Difference]: Finished difference Result 250 states and 281 transitions. [2018-01-20 23:23:47,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-20 23:23:47,530 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-01-20 23:23:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:47,531 INFO L225 Difference]: With dead ends: 250 [2018-01-20 23:23:47,531 INFO L226 Difference]: Without dead ends: 220 [2018-01-20 23:23:47,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1046, Invalid=5926, Unknown=0, NotChecked=0, Total=6972 [2018-01-20 23:23:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-20 23:23:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 109. [2018-01-20 23:23:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-20 23:23:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-20 23:23:47,540 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 34 [2018-01-20 23:23:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:47,540 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-20 23:23:47,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-20 23:23:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-20 23:23:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:23:47,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:47,541 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 23:23:47,541 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-20 23:23:47,542 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:47,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:47,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:47,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:47,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:47,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:47,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:47,608 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:47,608 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-20 23:23:47,608 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-20 23:23:47,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:47,608 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 23:23:47,615 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:23:47,616 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:23:47,625 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:47,629 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:47,631 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:23:47,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:47,695 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:47,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:47,750 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:23:47,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:23:47,755 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:23:47,771 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:47,791 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:47,812 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:23:47,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:47,861 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:47,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:23:47,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-20 23:23:47,898 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:23:47,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 23:23:47,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 23:23:47,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-01-20 23:23:47,899 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 11 states. [2018-01-20 23:23:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:47,973 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2018-01-20 23:23:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 23:23:47,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-20 23:23:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:47,975 INFO L225 Difference]: With dead ends: 201 [2018-01-20 23:23:47,975 INFO L226 Difference]: Without dead ends: 172 [2018-01-20 23:23:47,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-01-20 23:23:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-20 23:23:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2018-01-20 23:23:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-20 23:23:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-01-20 23:23:47,987 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 37 [2018-01-20 23:23:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:47,987 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-01-20 23:23:47,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 23:23:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-01-20 23:23:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:23:47,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:47,989 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 23:23:47,989 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-20 23:23:47,989 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:47,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:47,990 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 23:23:47,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:47,990 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:48,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:48,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:48,166 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:48,166 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-20 23:23:48,166 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-20 23:23:48,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:48,167 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 23:23:48,174 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:23:48,174 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:23:48,183 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:48,186 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:48,187 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:23:48,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:48,247 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:48,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:48,312 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:23:48,315 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:23:48,315 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:23:48,325 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:48,336 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:23:48,348 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:23:48,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:48,356 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:48,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:23:48,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-20 23:23:48,369 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:23:48,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 23:23:48,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 23:23:48,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-20 23:23:48,370 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 13 states. [2018-01-20 23:23:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:48,553 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2018-01-20 23:23:48,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 23:23:48,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-20 23:23:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:48,555 INFO L225 Difference]: With dead ends: 232 [2018-01-20 23:23:48,555 INFO L226 Difference]: Without dead ends: 194 [2018-01-20 23:23:48,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-20 23:23:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-20 23:23:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2018-01-20 23:23:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-20 23:23:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-20 23:23:48,568 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 37 [2018-01-20 23:23:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:48,568 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-20 23:23:48,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 23:23:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-20 23:23:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 23:23:48,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:48,569 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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-20 23:23:48,569 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-20 23:23:48,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:48,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,571 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 23:23:48,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:48,601 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:23:48,607 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:48,613 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:48,613 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:48,628 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:48,628 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:48,628 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:48,628 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:48,628 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:48,628 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:48,628 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:48,628 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:23:48,628 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:23:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:23:48,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:48,630 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:48,630 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-20 23:23:48,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:48,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:48,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:48,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:48,641 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-20 23:23:48,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:48,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:23:48,641 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:48,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:23:48,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:23:48,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:48,642 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 23:23:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:48,644 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-20 23:23:48,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:23:48,644 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 23:23:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:48,645 INFO L225 Difference]: With dead ends: 70 [2018-01-20 23:23:48,645 INFO L226 Difference]: Without dead ends: 40 [2018-01-20 23:23:48,645 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-20 23:23:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-20 23:23:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-20 23:23:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 23:23:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-20 23:23:48,648 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-20 23:23:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:48,648 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-20 23:23:48,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:23:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-20 23:23:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:23:48,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:48,649 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-20 23:23:48,649 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-20 23:23:48,649 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:48,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:48,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:48,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:48,696 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-20 23:23:48,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:48,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:23:48,696 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:48,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:23:48,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:23:48,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:23:48,697 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-20 23:23:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:48,709 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-20 23:23:48,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:23:48,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-20 23:23:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:48,710 INFO L225 Difference]: With dead ends: 105 [2018-01-20 23:23:48,710 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 23:23:48,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:23:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 23:23:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-20 23:23:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 23:23:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 23:23:48,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-20 23:23:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:48,713 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 23:23:48,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:23:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 23:23:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:23:48,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:48,714 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-20 23:23:48,714 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-20 23:23:48,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:48,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:48,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,715 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:48,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:48,742 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-20 23:23:48,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:48,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:23:48,742 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:48,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:23:48,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:23:48,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:23:48,743 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-20 23:23:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:48,762 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-20 23:23:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:23:48,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 23:23:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:48,764 INFO L225 Difference]: With dead ends: 71 [2018-01-20 23:23:48,764 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 23:23:48,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:23:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 23:23:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-20 23:23:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 23:23:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 23:23:48,766 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-20 23:23:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:48,766 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 23:23:48,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:23:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 23:23:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 23:23:48,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:48,767 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] [2018-01-20 23:23:48,767 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-20 23:23:48,767 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:48,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:48,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:48,769 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:48,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:23:48,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:48,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:23:48,808 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:48,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:23:48,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:23:48,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:23:48,809 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 23:23:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:48,826 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-20 23:23:48,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:23:48,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-20 23:23:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:48,826 INFO L225 Difference]: With dead ends: 43 [2018-01-20 23:23:48,827 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:23:48,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:23:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:23:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:23:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:23:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:23:48,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-20 23:23:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:48,828 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:23:48,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:23:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:23:48,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:23:48,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:23:48 BoogieIcfgContainer [2018-01-20 23:23:48,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:23:48,831 INFO L168 Benchmark]: Toolchain (without parser) took 21993.23 ms. Allocated memory was 305.1 MB in the beginning and 1.0 GB in the end (delta: 733.0 MB). Free memory was 264.1 MB in the beginning and 448.4 MB in the end (delta: -184.3 MB). Peak memory consumption was 548.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:48,832 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:23:48,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.09 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 254.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:48,832 INFO L168 Benchmark]: Boogie Preprocessor took 43.45 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:48,832 INFO L168 Benchmark]: RCFGBuilder took 291.14 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 235.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:48,833 INFO L168 Benchmark]: TraceAbstraction took 21418.00 ms. Allocated memory was 305.1 MB in the beginning and 1.0 GB in the end (delta: 733.0 MB). Free memory was 235.2 MB in the beginning and 448.4 MB in the end (delta: -213.2 MB). Peak memory consumption was 519.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:48,835 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.22 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.09 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 254.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.45 ms. Allocated memory is still 305.1 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 291.14 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 235.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 21418.00 ms. Allocated memory was 305.1 MB in the beginning and 1.0 GB in the end (delta: 733.0 MB). Free memory was 235.2 MB in the beginning and 448.4 MB in the end (delta: -213.2 MB). Peak memory consumption was 519.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 319 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 31.650901 RENAME_VARIABLES(MILLISECONDS) : 0.025335 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 31.308311 PROJECTAWAY(MILLISECONDS) : 170.659747 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.109545 DISJOIN(MILLISECONDS) : 5.613563 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.054954 ADD_EQUALITY(MILLISECONDS) : 0.044569 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020480 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 113 #UNFREEZE : 0 #CONJOIN : 92 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 111 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 361 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 31.958364 RENAME_VARIABLES(MILLISECONDS) : 0.020196 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 31.553078 PROJECTAWAY(MILLISECONDS) : 54.355661 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091423 DISJOIN(MILLISECONDS) : 3.315806 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.039907 ADD_EQUALITY(MILLISECONDS) : 0.026681 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.039519 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 132 #ADD_EQUALITY : 50 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 382 LocStat_NO_SUPPORTING_DISEQUALITIES : 98 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 17.610368 RENAME_VARIABLES(MILLISECONDS) : 0.020837 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 17.373050 PROJECTAWAY(MILLISECONDS) : 34.261000 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056037 DISJOIN(MILLISECONDS) : 1.493185 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.040925 ADD_EQUALITY(MILLISECONDS) : 0.018119 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010572 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 132 #ADD_EQUALITY : 48 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 364 LocStat_NO_SUPPORTING_DISEQUALITIES : 67 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.951992 RENAME_VARIABLES(MILLISECONDS) : 0.011446 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.795620 PROJECTAWAY(MILLISECONDS) : 30.993865 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.047558 DISJOIN(MILLISECONDS) : 0.558530 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.021461 ADD_EQUALITY(MILLISECONDS) : 0.021959 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009249 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 217 #UNFREEZE : 0 #CONJOIN : 148 #PROJECTAWAY : 154 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 214 #ADD_EQUALITY : 49 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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, 45 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=45occurred 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: [L541] int i, j, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={13:0}, length=3] [L545] int *arr = __builtin_alloca (length*sizeof(int)); [L546] i=0 VAL [__builtin_alloca (length*sizeof(int))={13:0}, arr={13:0}, i=0, length=3] [L546] COND TRUE i