java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:35:19,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:35:19,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:35:19,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:35:19,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:35:19,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:35:19,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:35:19,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:35:19,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:35:19,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:35:19,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:35:19,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:35:19,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:35:19,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:35:19,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:35:19,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:35:19,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:35:19,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:35:19,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:35:19,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:35:19,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:35:19,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:35:19,653 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:35:19,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:35:19,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:35:19,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:35:19,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:35:19,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:35:19,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:35:19,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:35:19,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:35:19,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:35:19,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:35:19,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:35:19,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:35:19,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:35:19,661 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:35:19,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:35:19,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:35:19,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:35:19,686 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:35:19,686 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:35:19,686 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:35:19,686 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:35:19,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:35:19,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:35:19,687 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:35:19,687 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:35:19,687 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:35:19,687 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:35:19,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:35:19,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:35:19,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:35:19,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:35:19,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:35:19,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:35:19,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:35:19,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:35:19,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:35:19,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:35:19,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:35:19,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:35:19,693 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:35:19,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:35:19,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:35:19,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:35:19,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:35:19,694 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:35:19,694 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:35:19,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:35:19,694 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:35:19,695 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:35:19,695 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:35:19,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:35:19,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:35:19,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:35:19,767 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:35:19,768 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:35:19,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-07 10:35:19,837 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a631887e0/8f5a778c099544b0912229e1e69dfb82/FLAGa95ee12eb [2018-11-07 10:35:20,273 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:35:20,274 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-07 10:35:20,279 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a631887e0/8f5a778c099544b0912229e1e69dfb82/FLAGa95ee12eb [2018-11-07 10:35:20,303 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a631887e0/8f5a778c099544b0912229e1e69dfb82 [2018-11-07 10:35:20,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:35:20,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:35:20,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:35:20,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:35:20,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:35:20,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46945a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20, skipping insertion in model container [2018-11-07 10:35:20,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:35:20,355 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:35:20,569 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:35:20,575 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:35:20,605 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:35:20,636 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:35:20,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20 WrapperNode [2018-11-07 10:35:20,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:35:20,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:35:20,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:35:20,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:35:20,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:35:20,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:35:20,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:35:20,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:35:20,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... [2018-11-07 10:35:20,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:35:20,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:35:20,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:35:20,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:35:20,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (1/1) ... No working directory specified, using /storage/repos/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-11-07 10:35:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:35:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:35:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:35:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:35:20,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:35:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:35:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:35:20,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:35:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:35:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:35:20,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:35:20,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:35:21,320 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:35:21,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:21 BoogieIcfgContainer [2018-11-07 10:35:21,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:35:21,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:35:21,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:35:21,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:35:21,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:35:20" (1/3) ... [2018-11-07 10:35:21,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d9b035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:35:21, skipping insertion in model container [2018-11-07 10:35:21,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:20" (2/3) ... [2018-11-07 10:35:21,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d9b035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:35:21, skipping insertion in model container [2018-11-07 10:35:21,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:21" (3/3) ... [2018-11-07 10:35:21,336 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-07 10:35:21,346 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:35:21,355 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:35:21,374 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:35:21,411 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:35:21,411 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:35:21,411 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:35:21,411 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:35:21,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:35:21,412 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:35:21,412 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:35:21,412 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:35:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 10:35:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:35:21,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:21,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:21,444 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:21,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2044028709, now seen corresponding path program 1 times [2018-11-07 10:35:21,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:21,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:21,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:21,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:35:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:35:21,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:35:21,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:35:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:35:21,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:35:21,665 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 10:35:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:21,699 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-07 10:35:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:35:21,701 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-07 10:35:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:21,712 INFO L225 Difference]: With dead ends: 57 [2018-11-07 10:35:21,713 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 10:35:21,717 INFO L604 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-11-07 10:35:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 10:35:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 10:35:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 10:35:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-07 10:35:21,765 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2018-11-07 10:35:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:21,766 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-07 10:35:21,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:35:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-07 10:35:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 10:35:21,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:21,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:21,768 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:21,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash -585673780, now seen corresponding path program 1 times [2018-11-07 10:35:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:21,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:35:21,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:35:21,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:35:21,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:35:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:35:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:35:21,906 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-07 10:35:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:22,120 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-07 10:35:22,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:35:22,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-07 10:35:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:22,122 INFO L225 Difference]: With dead ends: 56 [2018-11-07 10:35:22,122 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:35:22,123 INFO L604 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-11-07 10:35:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:35:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-07 10:35:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:35:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 10:35:22,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2018-11-07 10:35:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:22,134 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 10:35:22,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:35:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 10:35:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:35:22,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:22,135 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:22,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:22,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1124826267, now seen corresponding path program 1 times [2018-11-07 10:35:22,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:22,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:22,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:22,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:22,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:22,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:22,281 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 10:35:22,283 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [26], [31], [34], [35], [51], [54], [56], [62], [63], [64], [66] [2018-11-07 10:35:22,321 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:35:22,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:35:22,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:35:22,528 INFO L272 AbstractInterpreter]: Visited 21 different actions 31 times. Merged at 4 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-07 10:35:22,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:22,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:35:22,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:22,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 10:35:22,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:22,590 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:35:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:22,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:22,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-07 10:35:22,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-07 10:35:22,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:22,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:22,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:22,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-07 10:35:22,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-07 10:35:22,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-07 10:35:22,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:23,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:23,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:23,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-07 10:35:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:23,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:23,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-07 10:35:23,676 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-07 10:35:23,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:23,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:23,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-07 10:35:23,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-07 10:35:23,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:23,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:25,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-07 10:35:26,098 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-07 10:35:26,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-07 10:35:26,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:26,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:26,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:26,197 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:131, output treesize:7 [2018-11-07 10:35:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:26,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 9] total 16 [2018-11-07 10:35:26,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:26,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:35:26,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:35:26,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:35:26,247 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2018-11-07 10:35:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:26,615 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-07 10:35:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:35:26,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-07 10:35:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:26,617 INFO L225 Difference]: With dead ends: 74 [2018-11-07 10:35:26,617 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 10:35:26,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:35:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 10:35:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-07 10:35:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:35:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-07 10:35:26,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2018-11-07 10:35:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:26,638 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-07 10:35:26,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:35:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-07 10:35:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 10:35:26,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:26,641 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:26,641 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:26,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2137976925, now seen corresponding path program 1 times [2018-11-07 10:35:26,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:26,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:26,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:35:26,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:26,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:26,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-07 10:35:26,785 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [26], [31], [34], [35], [37], [39], [40], [44], [51], [54], [56], [59], [61], [62], [63], [64], [66], [67], [68] [2018-11-07 10:35:26,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:35:26,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:35:26,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:35:26,945 INFO L272 AbstractInterpreter]: Visited 29 different actions 79 times. Merged at 13 different actions 24 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-07 10:35:26,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:26,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:35:26,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:26,979 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:26,998 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:35:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:27,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:27,167 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 10:35:27,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:27,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-07 10:35:27,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 10:35:27,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:27,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:27,348 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-11-07 10:35:27,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:22 [2018-11-07 10:35:28,025 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 25 treesize of output 21 [2018-11-07 10:35:28,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:35:28,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-07 10:35:28,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:28,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:28,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 10:35:28,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2018-11-07 10:35:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:28,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:30,687 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 28 [2018-11-07 10:35:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-11-07 10:35:30,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:30,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:30,739 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 27 [2018-11-07 10:35:30,764 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-07 10:35:30,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:30,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:30,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:30,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:97, output treesize:7 [2018-11-07 10:35:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:30,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:30,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 11] total 23 [2018-11-07 10:35:30,885 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:30,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:35:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:35:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=431, Unknown=1, NotChecked=0, Total=506 [2018-11-07 10:35:30,888 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 14 states. [2018-11-07 10:35:33,547 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-07 10:35:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:33,941 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-11-07 10:35:33,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:35:33,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-07 10:35:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:33,952 INFO L225 Difference]: With dead ends: 100 [2018-11-07 10:35:33,952 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:35:33,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=118, Invalid=637, Unknown=1, NotChecked=0, Total=756 [2018-11-07 10:35:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:35:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-11-07 10:35:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 10:35:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-11-07 10:35:33,973 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 37 [2018-11-07 10:35:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:33,973 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-11-07 10:35:33,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:35:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-11-07 10:35:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 10:35:33,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:33,978 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:33,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:33,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash -437771018, now seen corresponding path program 1 times [2018-11-07 10:35:33,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:33,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:33,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-07 10:35:34,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:34,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:34,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 10:35:34,202 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [26], [31], [34], [35], [37], [39], [40], [42], [44], [51], [54], [56], [59], [61], [62], [63], [64], [66], [67], [68], [69] [2018-11-07 10:35:34,204 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:35:34,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:35:34,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:35:34,390 INFO L272 AbstractInterpreter]: Visited 31 different actions 83 times. Merged at 14 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 17 variables. [2018-11-07 10:35:34,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:34,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:35:34,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:34,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 10:35:34,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:34,433 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:35:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:34,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:34,565 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 10:35:34,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:34,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-07 10:35:34,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 10:35:34,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:34,603 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:34,610 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-11-07 10:35:34,611 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:22 [2018-11-07 10:35:35,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-07 10:35:35,359 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:35:35,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-07 10:35:35,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:35,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:35,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 10:35:35,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2018-11-07 10:35:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:35:35,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:36,035 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-11-07 10:35:36,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-07 10:35:36,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:35:36,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:36,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:35:36,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:141, output treesize:7 [2018-11-07 10:35:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:35:36,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:36,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 13] total 27 [2018-11-07 10:35:36,211 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:36,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:35:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:35:36,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:35:36,213 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 16 states. [2018-11-07 10:35:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:39,123 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-11-07 10:35:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:35:39,124 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-07 10:35:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:39,126 INFO L225 Difference]: With dead ends: 126 [2018-11-07 10:35:39,127 INFO L226 Difference]: Without dead ends: 84 [2018-11-07 10:35:39,128 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:35:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-07 10:35:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2018-11-07 10:35:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:35:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-07 10:35:39,142 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 52 [2018-11-07 10:35:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:39,143 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-07 10:35:39,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:35:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-07 10:35:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 10:35:39,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:39,145 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:39,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:39,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:39,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1834499278, now seen corresponding path program 2 times [2018-11-07 10:35:39,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:39,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:39,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:35:39,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:39,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:39,317 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:39,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:39,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:39,318 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:39,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:35:39,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:04,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:36:04,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:04,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:04,593 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 32 treesize of output 29 [2018-11-07 10:36:04,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 10:36:04,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:36:04,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:36:04,609 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 10:36:04,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 10:36:04,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:36:04,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:22 [2018-11-07 10:36:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:04,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:09,247 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 34 [2018-11-07 10:36:09,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-11-07 10:36:09,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:36:09,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:36:09,307 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 37 treesize of output 35 [2018-11-07 10:36:09,419 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-11-07 10:36:09,429 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-11-07 10:36:09,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:36:09,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:36:09,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:36:09,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:118, output treesize:7 [2018-11-07 10:36:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:36:10,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:10,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 18] total 25 [2018-11-07 10:36:10,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:10,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:36:10,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:36:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=478, Unknown=2, NotChecked=0, Total=600 [2018-11-07 10:36:10,908 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-11-07 10:36:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:11,334 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-07 10:36:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:36:11,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-07 10:36:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:11,336 INFO L225 Difference]: With dead ends: 148 [2018-11-07 10:36:11,336 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 10:36:11,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=120, Invalid=478, Unknown=2, NotChecked=0, Total=600 [2018-11-07 10:36:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 10:36:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-11-07 10:36:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 10:36:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-07 10:36:11,350 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 67 [2018-11-07 10:36:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:11,351 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-07 10:36:11,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:36:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-07 10:36:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:36:11,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:11,352 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:11,352 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:11,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:11,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1873888071, now seen corresponding path program 3 times [2018-11-07 10:36:11,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:11,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:11,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:11,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:11,579 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:11,579 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:11,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:11,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:11,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 10:36:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:11,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:11,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:11,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:11,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:11,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:13,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:13,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 10:36:13,111 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:13,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:36:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:36:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:36:13,112 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-11-07 10:36:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:13,494 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-11-07 10:36:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:36:13,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-07 10:36:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:13,496 INFO L225 Difference]: With dead ends: 166 [2018-11-07 10:36:13,496 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 10:36:13,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:36:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 10:36:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-11-07 10:36:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 10:36:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-11-07 10:36:13,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 71 [2018-11-07 10:36:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:13,514 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-11-07 10:36:13,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:36:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-07 10:36:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-07 10:36:13,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:13,516 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:13,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:13,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:13,517 INFO L82 PathProgramCache]: Analyzing trace with hash 121608896, now seen corresponding path program 4 times [2018-11-07 10:36:13,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:13,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:13,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:13,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:13,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:13,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:13,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:13,768 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:13,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:13,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:13,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:13,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:13,781 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:13,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:13,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:16,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:16,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 10:36:16,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:16,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:36:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:36:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:36:16,936 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 9 states. [2018-11-07 10:36:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:17,335 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2018-11-07 10:36:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:36:17,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-11-07 10:36:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:17,336 INFO L225 Difference]: With dead ends: 184 [2018-11-07 10:36:17,336 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 10:36:17,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:36:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 10:36:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2018-11-07 10:36:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 10:36:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-11-07 10:36:17,354 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 75 [2018-11-07 10:36:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:17,355 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-11-07 10:36:17,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:36:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-07 10:36:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:36:17,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:17,356 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:17,357 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:17,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:17,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1091297977, now seen corresponding path program 5 times [2018-11-07 10:36:17,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:17,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:17,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:17,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:17,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:17,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:17,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:17,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:17,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 10:36:17,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:36:17,700 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:23,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:36:23,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:23,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:23,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 115 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:36:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 23 [2018-11-07 10:36:25,282 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:25,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:36:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:36:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-11-07 10:36:25,283 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 10 states. [2018-11-07 10:36:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:25,796 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2018-11-07 10:36:25,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:36:25,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-11-07 10:36:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:25,799 INFO L225 Difference]: With dead ends: 202 [2018-11-07 10:36:25,799 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 10:36:25,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-11-07 10:36:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 10:36:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-11-07 10:36:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 10:36:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-07 10:36:25,814 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 79 [2018-11-07 10:36:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:25,815 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-07 10:36:25,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:36:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-07 10:36:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 10:36:25,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:25,817 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:25,817 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:25,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1408891826, now seen corresponding path program 6 times [2018-11-07 10:36:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:25,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:25,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:25,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:25,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:26,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:26,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:26,126 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:26,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:26,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:26,126 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:26,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:26,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:26,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:26,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:26,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:26,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:31,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:31,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 10:36:31,107 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:31,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:36:31,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:36:31,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:36:31,108 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 11 states. [2018-11-07 10:36:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:32,213 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-11-07 10:36:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:36:32,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-07 10:36:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:32,216 INFO L225 Difference]: With dead ends: 220 [2018-11-07 10:36:32,217 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 10:36:32,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:36:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 10:36:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-11-07 10:36:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 10:36:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-11-07 10:36:32,232 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 83 [2018-11-07 10:36:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:32,232 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-11-07 10:36:32,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:36:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-11-07 10:36:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 10:36:32,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:32,234 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:32,234 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:32,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1613696981, now seen corresponding path program 7 times [2018-11-07 10:36:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:32,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:32,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:32,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:32,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:32,754 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:32,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:32,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:32,754 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 10:36:32,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:32,768 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:32,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:32,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:37,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:37,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 10:36:37,722 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:37,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:36:37,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:36:37,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:36:37,723 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 12 states. [2018-11-07 10:36:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:38,568 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2018-11-07 10:36:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:36:38,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-11-07 10:36:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:38,570 INFO L225 Difference]: With dead ends: 238 [2018-11-07 10:36:38,571 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 10:36:38,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:36:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 10:36:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-11-07 10:36:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 10:36:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-11-07 10:36:38,585 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 87 [2018-11-07 10:36:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:38,585 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-11-07 10:36:38,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:36:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-07 10:36:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 10:36:38,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:38,587 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:38,587 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:38,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2051604444, now seen corresponding path program 8 times [2018-11-07 10:36:38,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:38,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:38,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 6 proven. 200 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:39,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:39,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:39,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:39,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:39,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:39,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:39,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:36:39,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:46,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:36:46,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:46,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:46,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 6 proven. 200 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:53,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:53,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 10:36:53,891 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:53,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:36:53,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:36:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:36:53,892 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 13 states. [2018-11-07 10:36:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:54,829 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2018-11-07 10:36:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:36:54,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-11-07 10:36:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:54,831 INFO L225 Difference]: With dead ends: 256 [2018-11-07 10:36:54,832 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 10:36:54,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:36:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 10:36:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-11-07 10:36:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-07 10:36:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-11-07 10:36:54,848 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 91 [2018-11-07 10:36:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:54,848 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-11-07 10:36:54,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:36:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-11-07 10:36:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 10:36:54,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:54,850 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:54,850 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:54,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash 374183011, now seen corresponding path program 9 times [2018-11-07 10:36:54,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:54,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:54,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 6 proven. 242 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:36:55,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:55,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:55,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:55,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:36:55,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:55,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 10:36:55,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:55,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:55,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:55,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:55,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:36:55,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 6 proven. 242 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:37:04,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:04,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 10:37:04,228 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:04,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:37:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:37:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:04,229 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 14 states. [2018-11-07 10:37:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:05,306 INFO L93 Difference]: Finished difference Result 274 states and 297 transitions. [2018-11-07 10:37:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:37:05,307 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-11-07 10:37:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:05,309 INFO L225 Difference]: With dead ends: 274 [2018-11-07 10:37:05,309 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 10:37:05,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:37:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 10:37:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2018-11-07 10:37:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-07 10:37:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-11-07 10:37:05,324 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 95 [2018-11-07 10:37:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:05,325 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-11-07 10:37:05,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:37:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-11-07 10:37:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:37:05,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:05,326 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:05,327 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:05,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1029082474, now seen corresponding path program 10 times [2018-11-07 10:37:05,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:05,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:05,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:37:05,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:05,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:05,636 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:05,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:05,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:05,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:05,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:05,644 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:05,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:37:05,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:37:15,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:15,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 10:37:15,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:15,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:37:15,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:37:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:37:15,471 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 15 states. [2018-11-07 10:37:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:16,585 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2018-11-07 10:37:16,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:37:16,588 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-11-07 10:37:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:16,589 INFO L225 Difference]: With dead ends: 292 [2018-11-07 10:37:16,590 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 10:37:16,591 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:37:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 10:37:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2018-11-07 10:37:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 10:37:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-11-07 10:37:16,612 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 99 [2018-11-07 10:37:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:16,612 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-11-07 10:37:16,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:37:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-11-07 10:37:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 10:37:16,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:16,614 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:16,614 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:16,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1436396273, now seen corresponding path program 11 times [2018-11-07 10:37:16,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:16,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:16,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 6 proven. 338 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:37:17,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:17,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:17,551 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:17,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:17,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:17,551 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:17,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:17,560 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:24,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 10:37:24,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:24,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:37:24,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:25,897 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:26,917 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:27,656 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:28,837 WARN L179 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:30,412 WARN L179 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:31,394 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:37,210 WARN L179 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:38,900 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:39,965 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:46,720 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:37:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 6 proven. 338 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:37:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:46,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 31 [2018-11-07 10:37:46,762 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:46,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:37:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:37:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=657, Unknown=3, NotChecked=0, Total=930 [2018-11-07 10:37:46,763 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 16 states. [2018-11-07 10:37:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:48,011 INFO L93 Difference]: Finished difference Result 310 states and 337 transitions. [2018-11-07 10:37:48,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:37:48,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-11-07 10:37:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:48,013 INFO L225 Difference]: With dead ends: 310 [2018-11-07 10:37:48,013 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 10:37:48,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=270, Invalid=657, Unknown=3, NotChecked=0, Total=930 [2018-11-07 10:37:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 10:37:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-11-07 10:37:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-07 10:37:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-11-07 10:37:48,032 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 103 [2018-11-07 10:37:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:48,032 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-11-07 10:37:48,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:37:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-11-07 10:37:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:37:48,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:48,034 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:48,034 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:48,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1837323016, now seen corresponding path program 12 times [2018-11-07 10:37:48,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:48,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:48,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 392 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:37:48,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:48,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:48,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:48,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:48,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:48,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:48,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:48,370 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:48,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:48,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:48,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:37:48,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 392 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:38:05,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 10:38:05,052 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:05,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:38:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:38:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:38:05,054 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 17 states. [2018-11-07 10:38:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:06,346 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2018-11-07 10:38:06,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:38:06,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-11-07 10:38:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:06,347 INFO L225 Difference]: With dead ends: 328 [2018-11-07 10:38:06,347 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 10:38:06,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:38:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 10:38:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2018-11-07 10:38:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 10:38:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-11-07 10:38:06,363 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 107 [2018-11-07 10:38:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:06,363 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-11-07 10:38:06,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:38:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-11-07 10:38:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 10:38:06,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:06,364 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:06,365 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:06,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:06,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1684886399, now seen corresponding path program 13 times [2018-11-07 10:38:06,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:06,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:06,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:06,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:06,366 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 6 proven. 450 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:38:06,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:06,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:06,928 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:06,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:06,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:06,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:06,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:06,946 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:06,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:38:07,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 6 proven. 450 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:38:21,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:21,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 10:38:21,983 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:21,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:38:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:38:21,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:38:21,984 INFO L87 Difference]: Start difference. First operand 199 states and 213 transitions. Second operand 18 states. [2018-11-07 10:38:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:23,941 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2018-11-07 10:38:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:38:23,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-07 10:38:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:23,950 INFO L225 Difference]: With dead ends: 346 [2018-11-07 10:38:23,950 INFO L226 Difference]: Without dead ends: 216 [2018-11-07 10:38:23,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:38:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-07 10:38:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2018-11-07 10:38:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 10:38:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-11-07 10:38:23,969 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 111 [2018-11-07 10:38:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:23,969 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-11-07 10:38:23,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:38:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-11-07 10:38:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 10:38:23,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:23,970 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:23,971 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:23,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -385261946, now seen corresponding path program 14 times [2018-11-07 10:38:23,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:23,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:23,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 6 proven. 512 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:38:24,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:24,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:24,327 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:24,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:38:24,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:24,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:24,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:24,336 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:51,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 10:38:51,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:51,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:38:51,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 6 proven. 512 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:39:13,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:13,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 10:39:13,426 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:13,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:39:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:39:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:39:13,428 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 19 states. [2018-11-07 10:39:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:16,661 INFO L93 Difference]: Finished difference Result 364 states and 397 transitions. [2018-11-07 10:39:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:39:16,662 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-11-07 10:39:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:16,663 INFO L225 Difference]: With dead ends: 364 [2018-11-07 10:39:16,664 INFO L226 Difference]: Without dead ends: 227 [2018-11-07 10:39:16,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:39:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-07 10:39:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2018-11-07 10:39:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 10:39:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 237 transitions. [2018-11-07 10:39:16,684 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 237 transitions. Word has length 115 [2018-11-07 10:39:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:16,685 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 237 transitions. [2018-11-07 10:39:16,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:39:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 237 transitions. [2018-11-07 10:39:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:39:16,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:16,686 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:16,686 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:16,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:16,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1527418381, now seen corresponding path program 15 times [2018-11-07 10:39:16,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:16,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:16,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 6 proven. 578 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:39:17,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:17,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:17,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:17,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:17,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:17,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:17,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:17,073 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:17,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:17,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:17,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:39:17,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 6 proven. 578 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:39:38,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:38,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 10:39:38,087 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:38,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:39:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:39:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:39:38,088 INFO L87 Difference]: Start difference. First operand 221 states and 237 transitions. Second operand 20 states. [2018-11-07 10:39:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:39,889 INFO L93 Difference]: Finished difference Result 382 states and 417 transitions. [2018-11-07 10:39:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:39:39,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-11-07 10:39:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:39,892 INFO L225 Difference]: With dead ends: 382 [2018-11-07 10:39:39,892 INFO L226 Difference]: Without dead ends: 238 [2018-11-07 10:39:39,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:39:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-07 10:39:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2018-11-07 10:39:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-07 10:39:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 249 transitions. [2018-11-07 10:39:39,914 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 249 transitions. Word has length 119 [2018-11-07 10:39:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:39,914 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 249 transitions. [2018-11-07 10:39:39,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:39:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 249 transitions. [2018-11-07 10:39:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 10:39:39,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:39,915 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:39,916 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:39,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2109038060, now seen corresponding path program 16 times [2018-11-07 10:39:39,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:39,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:39,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:39,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:39,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 6 proven. 648 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 10:39:40,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:40,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:40,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:40,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:39:40,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:40,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:40,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:40,419 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:40,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 10:39:40,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 10:39:55,679 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:39:55,880 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:55,881 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:39:55,886 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:39:55,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:39:55 BoogieIcfgContainer [2018-11-07 10:39:55,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:39:55,887 INFO L168 Benchmark]: Toolchain (without parser) took 275573.41 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 968.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.4 MB). Peak memory consumption was 275.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:39:55,887 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:39:55,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:39:55,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:39:55,889 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:39:55,889 INFO L168 Benchmark]: RCFGBuilder took 609.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:39:55,890 INFO L168 Benchmark]: TraceAbstraction took 274564.38 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 205.0 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 101.6 MB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:39:55,893 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 609.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 274564.38 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 205.0 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 101.6 MB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 124 with TraceHistMax 19,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 1 error locations. TIMEOUT Result, 274.4s OverallTime, 20 OverallIterations, 19 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1168 SDtfs, 1070 SDslu, 10448 SDs, 0 SdLazy, 17743 SolverSat, 270 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3031 GetRequests, 2574 SyntacticMatches, 42 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 153.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 108 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 73.8s SatisfiabilityAnalysisTime, 159.3s InterpolantComputationTime, 2861 NumberOfCodeBlocks, 2861 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 4221 ConstructedInterpolants, 51 QuantifiedInterpolants, 1646317 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2480 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 1841/12633 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown