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-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:17:15,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:17:15,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:17:15,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:17:15,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:17:15,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:17:15,609 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:17:15,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:17:15,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:17:15,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:17:15,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:17:15,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:17:15,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:17:15,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:17:15,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:17:15,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:17:15,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:17:15,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:17:15,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:17:15,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:17:15,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:17:15,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:17:15,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:17:15,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:17:15,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:17:15,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:17:15,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:17:15,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:17:15,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:17:15,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:17:15,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:17:15,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:17:15,637 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:17:15,637 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:17:15,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:17:15,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:17:15,640 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:17:15,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:17:15,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:17:15,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:17:15,657 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:17:15,657 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:17:15,657 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:17:15,657 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:17:15,658 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:17:15,658 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:17:15,658 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:17:15,658 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:17:15,658 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:17:15,658 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:17:15,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:17:15,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:17:15,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:17:15,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:17:15,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:17:15,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:17:15,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:17:15,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:17:15,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:17:15,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:17:15,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:17:15,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:17:15,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:17:15,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:17:15,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:17:15,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:17:15,662 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:17:15,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:17:15,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:17:15,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:17:15,663 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:17:15,663 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:17:15,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:17:15,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:17:15,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:17:15,735 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:17:15,736 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:17:15,737 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-07 22:17:15,809 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde7103fe/61429836a5f441dc95503abc01a95450/FLAG5021a461c [2018-11-07 22:17:16,254 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:17:16,255 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-07 22:17:16,260 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde7103fe/61429836a5f441dc95503abc01a95450/FLAG5021a461c [2018-11-07 22:17:16,276 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde7103fe/61429836a5f441dc95503abc01a95450 [2018-11-07 22:17:16,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:17:16,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:17:16,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:17:16,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:17:16,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:17:16,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b29a96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16, skipping insertion in model container [2018-11-07 22:17:16,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:17:16,337 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:17:16,577 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:17:16,582 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:17:16,601 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:17:16,619 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:17:16,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16 WrapperNode [2018-11-07 22:17:16,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:17:16,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:17:16,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:17:16,621 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:17:16,631 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:17:16" (1/1) ... [2018-11-07 22:17:16,640 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:17:16" (1/1) ... [2018-11-07 22:17:16,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:17:16,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:17:16,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:17:16,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:17:16,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (1/1) ... [2018-11-07 22:17:16,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:17:16,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:17:16,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:17:16,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:17:16,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (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 22:17:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:17:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:17:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:17:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:17:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:17:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:17:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:17:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:17:17,035 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:17:17,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:17 BoogieIcfgContainer [2018-11-07 22:17:17,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:17:17,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:17:17,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:17:17,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:17:17,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:17:16" (1/3) ... [2018-11-07 22:17:17,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4706fde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:17, skipping insertion in model container [2018-11-07 22:17:17,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:16" (2/3) ... [2018-11-07 22:17:17,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4706fde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:17, skipping insertion in model container [2018-11-07 22:17:17,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:17" (3/3) ... [2018-11-07 22:17:17,044 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono5_false-unreach-call1.c [2018-11-07 22:17:17,056 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:17:17,065 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:17:17,092 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:17:17,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:17:17,135 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:17:17,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:17:17,136 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:17:17,136 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:17:17,136 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:17:17,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:17:17,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:17:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 22:17:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 22:17:17,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:17,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:17,172 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:17,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-07 22:17:17,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:17,318 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 22:17:17,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:17:17,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:17:17,321 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:17:17,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:17:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:17:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:17:17,345 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 22:17:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:17,369 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 22:17:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:17:17,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 22:17:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:17,380 INFO L225 Difference]: With dead ends: 31 [2018-11-07 22:17:17,381 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 22:17:17,384 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 22:17:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 22:17:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 22:17:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 22:17:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 22:17:17,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 22:17:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:17,423 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 22:17:17,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:17:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 22:17:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 22:17:17,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:17,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:17,425 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:17,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 22:17:17,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:17,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:17:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:17:17,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:17:17,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:17:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:17:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:17:17,700 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-07 22:17:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:17,770 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-07 22:17:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:17:17,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-07 22:17:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:17,772 INFO L225 Difference]: With dead ends: 23 [2018-11-07 22:17:17,772 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 22:17:17,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:17:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 22:17:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 22:17:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 22:17:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 22:17:17,781 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-07 22:17:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:17,781 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 22:17:17,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:17:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 22:17:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:17:17,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:17,783 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:17,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:17,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-07 22:17:17,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:17:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:17:17,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:17:17,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:17:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:17:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:17:17,896 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2018-11-07 22:17:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:17,969 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 22:17:17,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:17:17,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 22:17:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:17,970 INFO L225 Difference]: With dead ends: 31 [2018-11-07 22:17:17,970 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:17:17,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 22:17:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:17:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 22:17:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 22:17:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-07 22:17:17,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-07 22:17:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:17,977 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-07 22:17:17,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:17:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-07 22:17:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:17:17,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:17,978 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:17,979 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:17,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1263790289, now seen corresponding path program 1 times [2018-11-07 22:17:17,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:17,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:17,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:18,270 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-07 22:17:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:18,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:18,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:18,280 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-07 22:17:18,282 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 22:17:18,314 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:17:18,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:17:18,410 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:17:18,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:17:18,582 INFO L272 AbstractInterpreter]: Visited 15 different actions 87 times. Merged at 6 different actions 42 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 4 different actions. Largest state had 5 variables. [2018-11-07 22:17:18,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:18,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:17:18,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:18,617 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 22:17:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:18,638 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:17:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:18,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:18,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2018-11-07 22:17:18,932 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:18,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:17:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:17:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:17:18,933 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-07 22:17:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:19,000 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-07 22:17:19,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:17:19,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 22:17:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:19,003 INFO L225 Difference]: With dead ends: 35 [2018-11-07 22:17:19,003 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 22:17:19,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:17:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 22:17:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-07 22:17:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 22:17:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 22:17:19,010 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-07 22:17:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:19,011 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 22:17:19,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:17:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 22:17:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:17:19,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:19,012 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:19,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:19,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash -375813959, now seen corresponding path program 2 times [2018-11-07 22:17:19,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:19,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:19,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:19,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:19,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:19,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:19,208 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:19,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:19,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:19,209 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 22:17:19,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:17:19,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:17:19,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:17:19,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:19,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:17:19,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:17:19,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:19,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-11-07 22:17:19,696 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:19,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:17:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:17:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:17:19,698 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-11-07 22:17:20,002 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 22:17:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:20,285 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-07 22:17:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:17:20,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-07 22:17:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:20,288 INFO L225 Difference]: With dead ends: 46 [2018-11-07 22:17:20,288 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 22:17:20,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:17:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 22:17:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 22:17:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 22:17:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 22:17:20,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-11-07 22:17:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:20,296 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 22:17:20,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:17:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 22:17:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 22:17:20,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:20,297 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:20,298 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:20,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash 60088779, now seen corresponding path program 3 times [2018-11-07 22:17:20,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:20,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:20,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:20,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:20,525 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:20,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:20,526 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 22:17:20,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:17:20,534 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:17:20,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:17:20,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:20,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:17:20,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:17:20,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:20,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2018-11-07 22:17:20,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:20,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:17:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:17:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:17:20,715 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-07 22:17:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:20,860 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-07 22:17:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:17:20,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-07 22:17:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:20,862 INFO L225 Difference]: With dead ends: 55 [2018-11-07 22:17:20,862 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 22:17:20,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:17:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 22:17:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-07 22:17:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 22:17:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-07 22:17:20,870 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 31 [2018-11-07 22:17:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:20,870 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-07 22:17:20,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:17:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-07 22:17:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 22:17:20,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:20,872 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:20,872 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:20,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash -113592933, now seen corresponding path program 4 times [2018-11-07 22:17:20,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:20,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:20,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:20,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:21,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:21,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:21,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:21,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:21,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:21,171 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 22:17:21,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:21,191 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:17:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:21,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:17:21,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:17:21,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:21,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2018-11-07 22:17:21,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:21,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:17:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:17:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:17:21,426 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-11-07 22:17:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:21,723 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-07 22:17:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:17:21,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-07 22:17:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:21,725 INFO L225 Difference]: With dead ends: 63 [2018-11-07 22:17:21,725 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 22:17:21,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:17:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 22:17:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-07 22:17:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 22:17:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-07 22:17:21,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 39 [2018-11-07 22:17:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:21,734 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-07 22:17:21,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:17:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-07 22:17:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 22:17:21,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:21,736 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:21,736 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:21,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1492629867, now seen corresponding path program 5 times [2018-11-07 22:17:21,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:21,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:21,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:21,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:21,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:21,996 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:21,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:21,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:21,997 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 22:17:22,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:17:22,011 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:17:22,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:17:22,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:22,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:17:22,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:17:22,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:22,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 22 [2018-11-07 22:17:22,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:22,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:17:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:17:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:17:22,577 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 17 states. [2018-11-07 22:17:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:23,344 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-07 22:17:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:17:23,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-11-07 22:17:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:23,346 INFO L225 Difference]: With dead ends: 78 [2018-11-07 22:17:23,346 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 22:17:23,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:17:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 22:17:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-07 22:17:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 22:17:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-07 22:17:23,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 47 [2018-11-07 22:17:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:23,356 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-07 22:17:23,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:17:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-07 22:17:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:17:23,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:23,359 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:23,359 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:23,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash -642646683, now seen corresponding path program 6 times [2018-11-07 22:17:23,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:23,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:23,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 35 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:23,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:23,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:23,737 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:23,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:23,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:23,737 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 22:17:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:17:23,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:17:23,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:17:23,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:23,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 107 proven. 171 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:17:23,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 107 proven. 171 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:17:24,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:24,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 25 [2018-11-07 22:17:24,171 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:24,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:17:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:17:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:17:24,175 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 15 states. [2018-11-07 22:17:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:24,620 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-07 22:17:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:17:24,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-07 22:17:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:24,622 INFO L225 Difference]: With dead ends: 91 [2018-11-07 22:17:24,622 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 22:17:24,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:17:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 22:17:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-07 22:17:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-07 22:17:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-07 22:17:24,631 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 59 [2018-11-07 22:17:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:24,631 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-07 22:17:24,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:17:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-07 22:17:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 22:17:24,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:24,634 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:24,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:24,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 733358365, now seen corresponding path program 7 times [2018-11-07 22:17:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:24,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:24,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 44 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:25,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:25,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:25,286 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:25,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:25,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:25,287 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 22:17:25,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:25,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:17:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:25,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 140 proven. 300 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:17:25,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 140 proven. 300 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:17:26,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:26,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 31 [2018-11-07 22:17:26,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:26,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:17:26,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:17:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=648, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:17:26,034 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 18 states. [2018-11-07 22:17:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:26,792 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-07 22:17:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:17:26,796 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-07 22:17:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:26,797 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:17:26,797 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 22:17:26,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=648, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:17:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 22:17:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-07 22:17:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-07 22:17:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-07 22:17:26,819 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 71 [2018-11-07 22:17:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:26,819 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-07 22:17:26,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:17:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-07 22:17:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 22:17:26,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:26,824 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:26,826 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:26,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash 134119637, now seen corresponding path program 8 times [2018-11-07 22:17:26,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:26,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:26,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 53 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:30,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:30,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:30,248 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:30,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:30,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:30,248 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 22:17:30,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:17:30,261 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:17:30,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:17:30,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:30,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-07 22:17:30,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-07 22:17:30,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:30,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 33 [2018-11-07 22:17:30,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:30,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:17:30,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:17:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:17:30,647 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 27 states. [2018-11-07 22:17:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:33,130 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-11-07 22:17:33,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:17:33,130 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 22:17:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:33,132 INFO L225 Difference]: With dead ends: 122 [2018-11-07 22:17:33,133 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 22:17:33,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:17:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 22:17:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-07 22:17:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-07 22:17:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-07 22:17:33,145 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 83 [2018-11-07 22:17:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:33,146 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-07 22:17:33,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:17:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-07 22:17:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 22:17:33,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:33,148 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:33,148 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:33,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1864426569, now seen corresponding path program 9 times [2018-11-07 22:17:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:33,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:33,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 65 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:33,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:33,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:33,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:33,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:33,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:33,715 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 22:17:33,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:17:33,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:17:33,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:17:33,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:33,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 281 proven. 666 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:17:33,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 281 proven. 666 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:17:35,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:35,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 44 [2018-11-07 22:17:35,018 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:35,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:17:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:17:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:17:35,021 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 25 states. [2018-11-07 22:17:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:36,292 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-11-07 22:17:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:17:36,292 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-07 22:17:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:36,296 INFO L225 Difference]: With dead ends: 139 [2018-11-07 22:17:36,296 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 22:17:36,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:17:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 22:17:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-07 22:17:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 22:17:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-11-07 22:17:36,306 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 99 [2018-11-07 22:17:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:36,306 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-11-07 22:17:36,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:17:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-11-07 22:17:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 22:17:36,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:36,308 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:36,309 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:36,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1480580265, now seen corresponding path program 10 times [2018-11-07 22:17:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:36,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:36,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 77 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:37,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:37,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:37,083 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:37,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:37,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:37,084 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 22:17:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:37,093 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:17:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:37,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 341 proven. 990 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:17:37,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 341 proven. 990 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:17:38,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 52 [2018-11-07 22:17:38,722 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:38,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:17:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:17:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:17:38,724 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 29 states. [2018-11-07 22:17:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:40,076 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-11-07 22:17:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:17:40,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-07 22:17:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:40,080 INFO L225 Difference]: With dead ends: 155 [2018-11-07 22:17:40,080 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 22:17:40,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:17:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 22:17:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-11-07 22:17:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 22:17:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-11-07 22:17:40,091 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 115 [2018-11-07 22:17:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:40,091 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-11-07 22:17:40,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:17:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-07 22:17:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 22:17:40,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:40,094 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:40,094 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:40,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash -337777929, now seen corresponding path program 11 times [2018-11-07 22:17:40,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:40,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:40,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:40,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 89 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:41,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:41,422 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:41,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:41,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:41,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:41,423 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 22:17:41,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:17:41,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:17:41,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:17:41,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:41,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-07 22:17:41,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-07 22:17:42,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:42,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 9] total 47 [2018-11-07 22:17:42,129 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:42,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:17:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:17:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:17:42,131 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 40 states. [2018-11-07 22:17:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:45,443 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-11-07 22:17:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:17:45,444 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 131 [2018-11-07 22:17:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:45,446 INFO L225 Difference]: With dead ends: 178 [2018-11-07 22:17:45,446 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 22:17:45,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=454, Invalid=5552, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 22:17:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 22:17:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-07 22:17:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 22:17:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2018-11-07 22:17:45,457 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 131 [2018-11-07 22:17:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:45,458 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2018-11-07 22:17:45,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:17:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2018-11-07 22:17:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 22:17:45,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:45,460 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 30, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:45,460 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:45,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash 504657089, now seen corresponding path program 12 times [2018-11-07 22:17:45,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:45,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:45,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 104 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:46,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:46,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:46,827 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:46,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:46,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:46,828 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 22:17:46,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:17:46,836 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:17:46,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:17:46,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:46,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 476 proven. 1953 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:17:46,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 476 proven. 1953 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 22:17:49,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:49,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 70 [2018-11-07 22:17:49,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:49,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:17:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:17:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1324, Invalid=3506, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 22:17:49,557 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 38 states. [2018-11-07 22:17:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:51,933 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2018-11-07 22:17:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:17:51,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-07 22:17:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:51,935 INFO L225 Difference]: With dead ends: 199 [2018-11-07 22:17:51,935 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 22:17:51,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1324, Invalid=3506, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 22:17:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 22:17:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-11-07 22:17:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 22:17:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 179 transitions. [2018-11-07 22:17:51,945 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 179 transitions. Word has length 151 [2018-11-07 22:17:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:51,946 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 179 transitions. [2018-11-07 22:17:51,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:17:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2018-11-07 22:17:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 22:17:51,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:51,949 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:51,949 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:51,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1798768713, now seen corresponding path program 13 times [2018-11-07 22:17:51,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:51,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:51,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 119 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:17:53,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:53,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:53,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:53,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:53,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:53,923 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 22:17:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:53,932 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:17:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:53,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 679 proven. 2485 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:17:54,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 679 proven. 2485 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 22:17:57,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:57,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 79 [2018-11-07 22:17:57,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:57,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:17:57,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:17:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:17:57,141 INFO L87 Difference]: Start difference. First operand 173 states and 179 transitions. Second operand 43 states. [2018-11-07 22:18:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:18:00,592 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2018-11-07 22:18:00,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 22:18:00,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-07 22:18:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:18:00,597 INFO L225 Difference]: With dead ends: 219 [2018-11-07 22:18:00,597 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 22:18:00,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:18:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 22:18:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-11-07 22:18:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-07 22:18:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 199 transitions. [2018-11-07 22:18:00,606 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 199 transitions. Word has length 171 [2018-11-07 22:18:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:18:00,607 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 199 transitions. [2018-11-07 22:18:00,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:18:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 199 transitions. [2018-11-07 22:18:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 22:18:00,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:18:00,610 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 40, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:18:00,610 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:18:00,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:18:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1502906321, now seen corresponding path program 14 times [2018-11-07 22:18:00,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:18:00,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:00,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:18:00,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:00,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:18:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:18:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 134 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:18:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:01,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:18:01,887 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:18:01,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:18:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:01,887 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 22:18:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:18:01,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:18:01,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:18:01,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:18:01,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:18:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 810 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:18:02,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:18:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 810 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 22:18:02,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:18:02,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 10, 10] total 64 [2018-11-07 22:18:02,868 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:18:02,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 22:18:02,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 22:18:02,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3824, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 22:18:02,870 INFO L87 Difference]: Start difference. First operand 193 states and 199 transitions. Second operand 56 states. [2018-11-07 22:18:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:18:09,583 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2018-11-07 22:18:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 22:18:09,584 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 191 [2018-11-07 22:18:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:18:09,586 INFO L225 Difference]: With dead ends: 246 [2018-11-07 22:18:09,586 INFO L226 Difference]: Without dead ends: 218 [2018-11-07 22:18:09,591 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=709, Invalid=11281, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:18:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-07 22:18:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-11-07 22:18:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 22:18:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 224 transitions. [2018-11-07 22:18:09,600 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 224 transitions. Word has length 191 [2018-11-07 22:18:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:18:09,601 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 224 transitions. [2018-11-07 22:18:09,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 22:18:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 224 transitions. [2018-11-07 22:18:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 22:18:09,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:18:09,604 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 45, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:18:09,604 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:18:09,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:18:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1605843837, now seen corresponding path program 15 times [2018-11-07 22:18:09,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:18:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:09,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:18:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:09,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:18:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:18:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 152 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:18:11,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:11,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:18:11,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:18:11,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:18:11,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:11,463 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 22:18:11,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:18:11,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:18:11,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:18:11,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:18:11,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:18:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1052 proven. 4095 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 22:18:11,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:18:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1052 proven. 4095 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 22:18:16,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:18:16,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 48, 48] total 100 [2018-11-07 22:18:16,525 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:18:16,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 22:18:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 22:18:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=7260, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 22:18:16,527 INFO L87 Difference]: Start difference. First operand 217 states and 224 transitions. Second operand 54 states. [2018-11-07 22:18:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:18:21,638 INFO L93 Difference]: Finished difference Result 271 states and 290 transitions. [2018-11-07 22:18:21,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 22:18:21,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 215 [2018-11-07 22:18:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:18:21,640 INFO L225 Difference]: With dead ends: 271 [2018-11-07 22:18:21,641 INFO L226 Difference]: Without dead ends: 242 [2018-11-07 22:18:21,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 384 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2640, Invalid=7260, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 22:18:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-07 22:18:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-11-07 22:18:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-07 22:18:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 248 transitions. [2018-11-07 22:18:21,650 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 248 transitions. Word has length 215 [2018-11-07 22:18:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:18:21,650 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 248 transitions. [2018-11-07 22:18:21,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 22:18:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 248 transitions. [2018-11-07 22:18:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 22:18:21,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:18:21,653 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 51, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:18:21,654 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:18:21,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:18:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1571831821, now seen corresponding path program 16 times [2018-11-07 22:18:21,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:18:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:21,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:18:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:21,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:18:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:18:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 170 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:18:23,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:23,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:18:23,776 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:18:23,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:18:23,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:23,776 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 22:18:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:18:23,785 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:18:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:18:23,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:18:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 1190 proven. 5253 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 22:18:24,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:18:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 1190 proven. 5253 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 22:18:30,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:18:30,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 54, 54] total 112 [2018-11-07 22:18:30,179 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:18:30,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 22:18:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 22:18:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3294, Invalid=9138, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 22:18:30,182 INFO L87 Difference]: Start difference. First operand 241 states and 248 transitions. Second operand 60 states. [2018-11-07 22:18:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:18:36,517 INFO L93 Difference]: Finished difference Result 295 states and 314 transitions. [2018-11-07 22:18:36,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 22:18:36,519 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 239 [2018-11-07 22:18:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:18:36,521 INFO L225 Difference]: With dead ends: 295 [2018-11-07 22:18:36,521 INFO L226 Difference]: Without dead ends: 266 [2018-11-07 22:18:36,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3294, Invalid=9138, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 22:18:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-07 22:18:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-11-07 22:18:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-07 22:18:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 272 transitions. [2018-11-07 22:18:36,534 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 272 transitions. Word has length 239 [2018-11-07 22:18:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:18:36,534 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 272 transitions. [2018-11-07 22:18:36,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 22:18:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 272 transitions. [2018-11-07 22:18:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 22:18:36,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:18:36,536 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 57, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:18:36,536 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:18:36,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:18:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1560843421, now seen corresponding path program 17 times [2018-11-07 22:18:36,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:18:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:36,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:18:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:18:36,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:18:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:18:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 188 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:18:38,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:38,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:18:38,781 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:18:38,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:18:38,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:18:38,781 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 22:18:38,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:18:38,789 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:19:03,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:19:03,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:19:03,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2018-11-07 22:19:03,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2018-11-07 22:19:05,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:19:05,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 11, 11] total 84 [2018-11-07 22:19:05,171 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:19:05,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 22:19:05,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 22:19:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6693, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 22:19:05,173 INFO L87 Difference]: Start difference. First operand 265 states and 272 transitions. Second operand 75 states. [2018-11-07 22:19:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:17,538 INFO L93 Difference]: Finished difference Result 326 states and 347 transitions. [2018-11-07 22:19:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-07 22:19:17,539 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 263 [2018-11-07 22:19:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:17,542 INFO L225 Difference]: With dead ends: 326 [2018-11-07 22:19:17,542 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 22:19:17,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1041, Invalid=20715, Unknown=0, NotChecked=0, Total=21756 [2018-11-07 22:19:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 22:19:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-11-07 22:19:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-07 22:19:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 301 transitions. [2018-11-07 22:19:17,553 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 301 transitions. Word has length 263 [2018-11-07 22:19:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:17,553 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 301 transitions. [2018-11-07 22:19:17,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 22:19:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 301 transitions. [2018-11-07 22:19:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-07 22:19:17,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:17,556 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 63, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:17,556 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:17,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1494174461, now seen corresponding path program 18 times [2018-11-07 22:19:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:17,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:19:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:17,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 209 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:20,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:20,844 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:20,844 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:19:20,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:19:20,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:20,844 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 22:19:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:19:20,853 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:19:20,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:19:20,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:19:20,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 1721 proven. 8001 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 22:19:21,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 1721 proven. 8001 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 22:19:30,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:19:30,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 66, 66] total 137 [2018-11-07 22:19:30,220 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:19:30,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 22:19:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 22:19:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4885, Invalid=13747, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 22:19:30,221 INFO L87 Difference]: Start difference. First operand 293 states and 301 transitions. Second operand 73 states. [2018-11-07 22:19:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:39,781 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2018-11-07 22:19:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 22:19:39,783 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 291 [2018-11-07 22:19:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:39,785 INFO L225 Difference]: With dead ends: 355 [2018-11-07 22:19:39,785 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 22:19:39,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 518 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=4885, Invalid=13747, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 22:19:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 22:19:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-11-07 22:19:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-07 22:19:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 329 transitions. [2018-11-07 22:19:39,796 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 329 transitions. Word has length 291 [2018-11-07 22:19:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:39,797 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 329 transitions. [2018-11-07 22:19:39,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 22:19:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 329 transitions. [2018-11-07 22:19:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-07 22:19:39,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:39,799 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 70, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:39,800 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash 348763733, now seen corresponding path program 19 times [2018-11-07 22:19:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:39,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:19:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:39,801 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 230 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:43,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:43,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:43,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:19:43,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:19:43,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:43,355 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:43,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:43,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:19:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:43,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 1910 proven. 9870 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 22:19:43,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 1910 proven. 9870 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 22:19:54,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:19:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 73, 73] total 151 [2018-11-07 22:19:54,731 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:19:54,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-07 22:19:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-07 22:19:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5914, Invalid=16736, Unknown=0, NotChecked=0, Total=22650 [2018-11-07 22:19:54,732 INFO L87 Difference]: Start difference. First operand 321 states and 329 transitions. Second operand 80 states. [2018-11-07 22:20:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:20:06,718 INFO L93 Difference]: Finished difference Result 383 states and 405 transitions. [2018-11-07 22:20:06,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-07 22:20:06,730 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 319 [2018-11-07 22:20:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:20:06,732 INFO L225 Difference]: With dead ends: 383 [2018-11-07 22:20:06,732 INFO L226 Difference]: Without dead ends: 350 [2018-11-07 22:20:06,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=5914, Invalid=16736, Unknown=0, NotChecked=0, Total=22650 [2018-11-07 22:20:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-07 22:20:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-11-07 22:20:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-07 22:20:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 357 transitions. [2018-11-07 22:20:06,744 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 357 transitions. Word has length 319 [2018-11-07 22:20:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:20:06,745 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 357 transitions. [2018-11-07 22:20:06,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-07 22:20:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 357 transitions. [2018-11-07 22:20:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 22:20:06,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:20:06,748 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 77, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:20:06,748 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:20:06,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:20:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -310628947, now seen corresponding path program 20 times [2018-11-07 22:20:06,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:20:06,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:20:06,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:20:06,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:20:06,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:20:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:20:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 251 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:20:10,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:20:10,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:20:10,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:20:10,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:20:10,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:20:10,975 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:20:10,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:20:10,983 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:20:14,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:20:14,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:20:14,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:20:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 0 proven. 2177 refuted. 0 times theorem prover too weak. 11935 trivial. 0 not checked. [2018-11-07 22:20:15,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:20:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 0 proven. 2177 refuted. 0 times theorem prover too weak. 11935 trivial. 0 not checked. [2018-11-07 22:20:16,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:20:16,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 12, 12] total 107 [2018-11-07 22:20:16,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:20:16,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 22:20:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 22:20:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=10981, Unknown=0, NotChecked=0, Total=11342 [2018-11-07 22:20:16,974 INFO L87 Difference]: Start difference. First operand 349 states and 357 transitions. Second operand 97 states. [2018-11-07 22:20:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:20:37,130 INFO L93 Difference]: Finished difference Result 418 states and 442 transitions. [2018-11-07 22:20:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-07 22:20:37,131 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 347 [2018-11-07 22:20:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:20:37,134 INFO L225 Difference]: With dead ends: 418 [2018-11-07 22:20:37,134 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 22:20:37,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 675 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3607 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1459, Invalid=35213, Unknown=0, NotChecked=0, Total=36672 [2018-11-07 22:20:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 22:20:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-07 22:20:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 22:20:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 390 transitions. [2018-11-07 22:20:37,147 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 390 transitions. Word has length 347 [2018-11-07 22:20:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:20:37,148 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 390 transitions. [2018-11-07 22:20:37,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 22:20:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 390 transitions. [2018-11-07 22:20:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-07 22:20:37,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:20:37,151 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 84, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:20:37,151 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:20:37,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:20:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash 234343471, now seen corresponding path program 21 times [2018-11-07 22:20:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:20:37,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:20:37,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:20:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:20:37,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:20:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:20:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 987 proven. 15931 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:20:41,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:20:41,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:20:41,936 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:20:41,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:20:41,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:20:41,936 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:20:41,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:20:41,945 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:20:42,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:20:42,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:20:42,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:20:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 2627 proven. 14196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:20:42,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:20:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 2627 proven. 14196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:20:57,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:20:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 87, 87] total 178 [2018-11-07 22:20:57,241 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:20:57,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 22:20:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 22:20:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8178, Invalid=23328, Unknown=0, NotChecked=0, Total=31506 [2018-11-07 22:20:57,244 INFO L87 Difference]: Start difference. First operand 381 states and 390 transitions. Second operand 93 states. [2018-11-07 22:21:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:21:12,077 INFO L93 Difference]: Finished difference Result 443 states and 466 transitions. [2018-11-07 22:21:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-11-07 22:21:12,078 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 379 [2018-11-07 22:21:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:21:12,080 INFO L225 Difference]: With dead ends: 443 [2018-11-07 22:21:12,080 INFO L226 Difference]: Without dead ends: 406 [2018-11-07 22:21:12,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 673 SyntacticMatches, 2 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=8178, Invalid=23328, Unknown=0, NotChecked=0, Total=31506 [2018-11-07 22:21:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-07 22:21:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-11-07 22:21:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-07 22:21:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 414 transitions. [2018-11-07 22:21:12,092 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 414 transitions. Word has length 379 [2018-11-07 22:21:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:21:12,093 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 414 transitions. [2018-11-07 22:21:12,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 22:21:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 414 transitions. [2018-11-07 22:21:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-11-07 22:21:12,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:21:12,095 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 90, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:21:12,096 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:21:12,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:21:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -350040161, now seen corresponding path program 22 times [2018-11-07 22:21:12,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:21:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:21:12,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:21:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:21:12,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:21:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:21:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 1053 proven. 18145 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:21:16,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:21:16,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:21:16,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:21:16,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:21:16,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:21:16,913 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:21:16,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:21:16,925 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:21:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:21:17,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:21:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 2813 proven. 16290 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 22:21:17,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 22:21:27,004 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:21:27,205 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:21:27,206 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:21:27,211 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:21:27,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:21:27 BoogieIcfgContainer [2018-11-07 22:21:27,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:21:27,212 INFO L168 Benchmark]: Toolchain (without parser) took 250919.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -494.9 MB). Peak memory consumption was 273.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:21:27,213 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 22:21:27,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.96 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 22:21:27,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.35 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 22:21:27,214 INFO L168 Benchmark]: Boogie Preprocessor took 20.27 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 22:21:27,215 INFO L168 Benchmark]: RCFGBuilder took 368.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 22:21:27,216 INFO L168 Benchmark]: TraceAbstraction took 250174.58 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 32.0 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 284.0 MB). Peak memory consumption was 316.0 MB. Max. memory is 7.1 GB. [2018-11-07 22:21:27,219 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 325.96 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 25.35 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 20.27 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 368.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250174.58 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 32.0 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 284.0 MB). Peak memory consumption was 316.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 404 with TraceHistMax 99,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 159 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 250.0s OverallTime, 25 OverallIterations, 99 TraceHistogramMax, 104.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1137 SDtfs, 2329 SDslu, 51847 SDs, 0 SdLazy, 144268 SolverSat, 761 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7662 GetRequests, 6018 SyntacticMatches, 37 SemanticMatches, 1607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7497 ImplicationChecksByTransitivity, 103.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 22 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 29.4s SatisfiabilityAnalysisTime, 97.9s InterpolantComputationTime, 6602 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 9819 ConstructedInterpolants, 0 QuantifiedInterpolants, 14239791 SizeOfPredicates, 28 NumberOfNonLiveVariables, 3479 ConjunctsInSsa, 1052 ConjunctsInUnsatCore, 66 InterpolantComputations, 3 PerfectInterpolantSequences, 72550/263636 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown