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.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:49:08,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:49:08,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:49:08,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:49:08,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:49:08,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:49:08,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:49:08,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:49:08,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:49:08,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:49:08,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:49:08,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:49:08,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:49:08,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:49:08,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:49:08,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:49:08,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:49:08,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:49:08,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:49:08,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:49:08,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:49:08,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:49:08,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:49:08,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:49:08,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:49:08,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:49:08,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:49:08,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:49:08,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:49:08,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:49:08,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:49:08,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:49:08,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:49:08,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:49:08,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:49:08,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:49:08,748 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.epf [2018-11-07 16:49:08,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:49:08,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:49:08,776 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:49:08,776 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:49:08,776 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:49:08,777 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:49:08,777 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:49:08,777 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:49:08,777 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:49:08,777 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:49:08,778 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:49:08,778 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:49:08,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:49:08,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:49:08,779 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:49:08,779 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:49:08,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:49:08,779 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:49:08,780 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:49:08,780 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:49:08,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:49:08,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:49:08,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:49:08,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:49:08,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:49:08,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:49:08,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:49:08,781 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:49:08,782 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:49:08,782 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:49:08,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:49:08,782 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:49:08,782 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:49:08,783 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:49:08,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:49:08,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:49:08,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:49:08,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:49:08,851 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:49:08,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-07 16:49:08,915 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e6f097a/68a4dd8bafc443e8b8f01c30d7d4e338/FLAG037df059a [2018-11-07 16:49:09,353 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:49:09,354 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-07 16:49:09,368 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e6f097a/68a4dd8bafc443e8b8f01c30d7d4e338/FLAG037df059a [2018-11-07 16:49:09,383 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e6f097a/68a4dd8bafc443e8b8f01c30d7d4e338 [2018-11-07 16:49:09,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:49:09,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:49:09,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:49:09,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:49:09,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:49:09,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59271772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09, skipping insertion in model container [2018-11-07 16:49:09,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:49:09,439 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:49:09,634 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:49:09,640 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:49:09,660 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:49:09,677 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:49:09,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09 WrapperNode [2018-11-07 16:49:09,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:49:09,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:49:09,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:49:09,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:49:09,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:49:09,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:49:09,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:49:09,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:49:09,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (1/1) ... [2018-11-07 16:49:09,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:49:09,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:49:09,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:49:09,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:49:09,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (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 16:49:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:49:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:49:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:49:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:49:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:49:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:49:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:49:09,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:49:10,079 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:49:10,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:10 BoogieIcfgContainer [2018-11-07 16:49:10,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:49:10,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:49:10,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:49:10,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:49:10,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:49:09" (1/3) ... [2018-11-07 16:49:10,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9ea752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:10, skipping insertion in model container [2018-11-07 16:49:10,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:09" (2/3) ... [2018-11-07 16:49:10,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9ea752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:10, skipping insertion in model container [2018-11-07 16:49:10,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:10" (3/3) ... [2018-11-07 16:49:10,088 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_false-unreach-call1.c [2018-11-07 16:49:10,098 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:49:10,106 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:49:10,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:49:10,160 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:49:10,160 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:49:10,160 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:49:10,161 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:49:10,161 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:49:10,161 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:49:10,161 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:49:10,161 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:49:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 16:49:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:49:10,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:10,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:10,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:10,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 16:49:10,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:10,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:10,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:10,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:10,303 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 16:49:10,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:49:10,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:49:10,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:49:10,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:49:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:49:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:49:10,329 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 16:49:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:10,351 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 16:49:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:49:10,353 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:49:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:10,362 INFO L225 Difference]: With dead ends: 30 [2018-11-07 16:49:10,363 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 16:49:10,366 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 16:49:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 16:49:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 16:49:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 16:49:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 16:49:10,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 16:49:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:10,405 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 16:49:10,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:49:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 16:49:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:49:10,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:10,407 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:10,407 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:10,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:10,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-07 16:49:10,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:10,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:10,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:10,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:10,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:10,566 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 16:49:10,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:49:10,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:49:10,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:49:10,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:49:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:49:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:49:10,570 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 16:49:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:10,656 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 16:49:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:49:10,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:49:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:10,658 INFO L225 Difference]: With dead ends: 24 [2018-11-07 16:49:10,658 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 16:49:10,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:49:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 16:49:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 16:49:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 16:49:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 16:49:10,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 16:49:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:10,666 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 16:49:10,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:49:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 16:49:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:49:10,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:10,674 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:10,675 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:10,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-07 16:49:10,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:10,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:10,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:10,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:10,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:10,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:10,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:10,807 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 16:49:10,809 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 16:49:10,844 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:49:10,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:49:11,004 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:49:11,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:49:11,155 INFO L272 AbstractInterpreter]: Visited 13 different actions 69 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 16:49:11,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:11,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:49:11,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:11,178 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 16:49:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:11,191 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:11,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:11,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:11,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:11,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 9 [2018-11-07 16:49:11,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:11,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:49:11,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:49:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:49:11,616 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-07 16:49:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:11,733 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-07 16:49:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:49:11,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 16:49:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:11,734 INFO L225 Difference]: With dead ends: 27 [2018-11-07 16:49:11,734 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 16:49:11,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:49:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 16:49:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 16:49:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 16:49:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 16:49:11,740 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 16:49:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:11,740 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 16:49:11,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:49:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 16:49:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:49:11,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:11,742 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:11,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:11,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-07 16:49:11,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:11,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:11,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:11,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:11,918 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:11,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:11,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:11,919 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 16:49:11,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:11,931 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:11,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:49:11,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:11,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:49:12,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:49:12,149 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:49:12,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2018-11-07 16:49:12,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:49:12,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:49:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:49:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:49:12,151 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-07 16:49:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:12,192 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-07 16:49:12,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:49:12,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 16:49:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:12,194 INFO L225 Difference]: With dead ends: 27 [2018-11-07 16:49:12,194 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:49:12,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:49:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:49:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 16:49:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 16:49:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 16:49:12,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-07 16:49:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:12,200 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 16:49:12,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:49:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 16:49:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:49:12,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:12,202 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:12,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:12,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-07 16:49:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:12,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:12,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:12,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:12,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:12,361 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 16:49:12,362 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 16:49:12,363 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:49:12,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:49:12,368 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:49:12,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:49:12,520 INFO L272 AbstractInterpreter]: Visited 14 different actions 87 times. Merged at 5 different actions 34 times. Widened at 2 different actions 4 times. Found 9 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 16:49:12,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:12,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:49:12,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:12,540 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 16:49:12,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:12,550 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:12,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:12,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:12,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:12,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-07 16:49:12,946 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:12,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:49:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:49:12,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:49:12,947 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-07 16:49:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:13,286 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-07 16:49:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:49:13,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 16:49:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:13,290 INFO L225 Difference]: With dead ends: 34 [2018-11-07 16:49:13,290 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 16:49:13,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:49:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 16:49:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 16:49:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 16:49:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 16:49:13,300 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-07 16:49:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:13,303 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 16:49:13,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:49:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 16:49:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:49:13,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:13,304 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:13,305 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:13,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-07 16:49:13,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:13,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:13,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:13,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:13,473 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:13,473 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:13,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:13,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:13,473 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 16:49:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:13,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:13,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:49:13,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:13,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 16:49:13,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 16:49:13,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:13,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 8] total 15 [2018-11-07 16:49:13,963 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:13,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:49:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:49:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:49:13,964 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-07 16:49:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:14,103 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-07 16:49:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:49:14,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 16:49:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:14,106 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:49:14,106 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 16:49:14,107 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:49:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 16:49:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 16:49:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 16:49:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 16:49:14,113 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2018-11-07 16:49:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:14,114 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 16:49:14,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:49:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 16:49:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:49:14,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:14,115 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:14,115 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:14,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-07 16:49:14,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:14,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:14,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:14,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:14,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:14,323 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:14,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:14,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:14,323 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 16:49:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:14,333 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:14,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:14,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:14,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:49:14,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:49:14,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:14,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-07 16:49:14,662 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:14,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:49:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:49:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:49:14,664 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 9 states. [2018-11-07 16:49:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:14,781 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-07 16:49:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:49:14,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 16:49:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:14,782 INFO L225 Difference]: With dead ends: 48 [2018-11-07 16:49:14,782 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:49:14,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:49:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:49:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 16:49:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 16:49:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-07 16:49:14,789 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2018-11-07 16:49:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:14,789 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-07 16:49:14,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:49:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-07 16:49:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:49:14,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:14,791 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:14,791 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:14,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-07 16:49:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:14,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:14,793 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:15,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:15,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:15,094 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:15,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:15,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:15,094 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 16:49:15,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:15,104 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:15,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:49:15,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:49:15,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:15,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-07 16:49:15,704 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:15,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:49:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:49:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:49:15,705 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2018-11-07 16:49:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:15,850 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-07 16:49:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:49:15,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 16:49:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:15,853 INFO L225 Difference]: With dead ends: 51 [2018-11-07 16:49:15,853 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:49:15,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:49:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:49:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 16:49:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 16:49:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-07 16:49:15,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2018-11-07 16:49:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:15,860 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-07 16:49:15,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:49:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-07 16:49:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:49:15,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:15,862 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:15,862 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:15,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-07 16:49:15,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:15,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:15,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:15,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:16,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:16,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:16,241 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:16,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:16,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:16,241 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 16:49:16,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:16,250 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:16,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 16:49:16,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:16,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:49:16,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:49:17,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:17,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 9] total 21 [2018-11-07 16:49:17,129 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:17,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:49:17,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:49:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:49:17,130 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 14 states. [2018-11-07 16:49:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:24,070 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-07 16:49:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:49:24,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-07 16:49:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:24,073 INFO L225 Difference]: With dead ends: 60 [2018-11-07 16:49:24,073 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 16:49:24,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=127, Invalid=378, Unknown=1, NotChecked=0, Total=506 [2018-11-07 16:49:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 16:49:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-07 16:49:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:49:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-07 16:49:24,081 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2018-11-07 16:49:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:24,082 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-07 16:49:24,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:49:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-07 16:49:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:49:24,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:24,083 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:24,083 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:24,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-07 16:49:24,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:24,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:24,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:24,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:24,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:24,288 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:24,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:24,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:24,289 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 16:49:24,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:24,299 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:24,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:24,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:24,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:24,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:24,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:24,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-07 16:49:24,968 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:24,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:49:24,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:49:24,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:49:24,971 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 13 states. [2018-11-07 16:49:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:25,175 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-07 16:49:25,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:49:25,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 16:49:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:25,177 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:49:25,177 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 16:49:25,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:49:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 16:49:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-07 16:49:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 16:49:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-07 16:49:25,184 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2018-11-07 16:49:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:25,184 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-07 16:49:25,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:49:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-07 16:49:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:49:25,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:25,186 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:25,186 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:25,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-07 16:49:25,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:25,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:25,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:25,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:25,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:25,466 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:25,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:25,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:25,466 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 16:49:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:25,481 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:25,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:49:25,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:49:26,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:26,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-07 16:49:26,231 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:26,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:49:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:49:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:49:26,233 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 14 states. [2018-11-07 16:49:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:26,549 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-07 16:49:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:49:26,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 16:49:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:26,551 INFO L225 Difference]: With dead ends: 64 [2018-11-07 16:49:26,551 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 16:49:26,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:49:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 16:49:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 16:49:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:49:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-07 16:49:26,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 44 [2018-11-07 16:49:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:26,559 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-07 16:49:26,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:49:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-07 16:49:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:49:26,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:26,560 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:26,560 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:26,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-07 16:49:26,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:26,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:26,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:26,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:29,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:29,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:29,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:29,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:29,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:29,015 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 16:49:29,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:29,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:29,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:49:29,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:29,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 16:49:29,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 16:49:29,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:29,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 10] total 27 [2018-11-07 16:49:29,793 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:29,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:49:29,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:49:29,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:49:29,795 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 19 states. [2018-11-07 16:49:33,927 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 16:49:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:38,859 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-11-07 16:49:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:49:38,860 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-07 16:49:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:38,861 INFO L225 Difference]: With dead ends: 77 [2018-11-07 16:49:38,861 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:49:38,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:49:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:49:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-11-07 16:49:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 16:49:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-07 16:49:38,869 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 47 [2018-11-07 16:49:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:38,870 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-07 16:49:38,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:49:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-07 16:49:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 16:49:38,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:38,871 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:38,871 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:38,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-07 16:49:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:38,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:38,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:39,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:39,157 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:39,157 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:39,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:39,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:39,158 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 16:49:39,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:39,174 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:39,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:39,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:39,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:49:39,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:49:39,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:39,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-07 16:49:39,955 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:39,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:49:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:49:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:49:39,956 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 17 states. [2018-11-07 16:49:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:40,222 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-11-07 16:49:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:49:40,223 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 16:49:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:40,225 INFO L225 Difference]: With dead ends: 81 [2018-11-07 16:49:40,225 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:49:40,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:49:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:49:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-07 16:49:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 16:49:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-07 16:49:40,233 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 53 [2018-11-07 16:49:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:40,234 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-07 16:49:40,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:49:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-07 16:49:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:49:40,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:40,235 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:40,235 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:40,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 10 times [2018-11-07 16:49:40,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:40,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:40,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:40,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:40,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:40,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:40,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:40,603 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:40,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:40,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:40,603 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 16:49:40,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:40,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:40,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:49:40,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:49:41,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:41,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 33 [2018-11-07 16:49:41,933 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:41,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:49:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:49:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:49:41,934 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-11-07 16:49:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:42,294 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-07 16:49:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:49:42,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 16:49:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:42,297 INFO L225 Difference]: With dead ends: 87 [2018-11-07 16:49:42,297 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:49:42,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:49:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:49:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-07 16:49:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 16:49:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-07 16:49:42,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 59 [2018-11-07 16:49:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:42,305 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-07 16:49:42,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:49:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-07 16:49:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:49:42,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:42,307 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:42,307 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:42,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:42,307 INFO L82 PathProgramCache]: Analyzing trace with hash 369721150, now seen corresponding path program 11 times [2018-11-07 16:49:42,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:42,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:42,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:42,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:42,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:42,852 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:42,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:42,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:42,853 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 16:49:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:42,867 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:42,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 16:49:42,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:42,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 16:49:43,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 16:49:43,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:43,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 11] total 35 [2018-11-07 16:49:43,677 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:43,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:49:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:49:43,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:49:43,678 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 26 states. [2018-11-07 16:49:55,761 WARN L179 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 16:50:04,289 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 16:50:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:07,049 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-11-07 16:50:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:50:07,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-07 16:50:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:07,051 INFO L225 Difference]: With dead ends: 99 [2018-11-07 16:50:07,051 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 16:50:07,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=374, Invalid=1184, Unknown=2, NotChecked=0, Total=1560 [2018-11-07 16:50:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 16:50:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-11-07 16:50:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 16:50:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-07 16:50:07,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 65 [2018-11-07 16:50:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:07,064 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-07 16:50:07,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:50:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-07 16:50:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:50:07,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:07,068 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:07,068 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:07,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash 10718589, now seen corresponding path program 12 times [2018-11-07 16:50:07,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:07,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:07,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:07,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:07,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:07,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:07,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:07,639 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:07,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:07,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:07,640 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 16:50:07,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:07,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:07,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:07,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:07,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:50:07,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:50:10,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:10,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 45 [2018-11-07 16:50:10,072 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:10,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:50:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:50:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:50:10,073 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 24 states. [2018-11-07 16:50:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:10,670 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-07 16:50:10,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:50:10,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 16:50:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:10,672 INFO L225 Difference]: With dead ends: 102 [2018-11-07 16:50:10,672 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 16:50:10,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:50:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 16:50:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-07 16:50:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 16:50:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-07 16:50:10,680 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2018-11-07 16:50:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:10,680 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-07 16:50:10,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:50:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-07 16:50:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 16:50:10,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:10,682 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:10,682 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:10,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:10,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1880758400, now seen corresponding path program 13 times [2018-11-07 16:50:10,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:10,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:10,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:10,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:10,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:12,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:12,146 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:12,146 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:12,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:12,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:12,146 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 16:50:12,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:12,155 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:12,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:50:12,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:50:14,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:14,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 44 [2018-11-07 16:50:14,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:50:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:50:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:50:14,453 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 25 states. [2018-11-07 16:50:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:15,213 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-07 16:50:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:50:15,214 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 16:50:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:15,215 INFO L225 Difference]: With dead ends: 105 [2018-11-07 16:50:15,215 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 16:50:15,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:50:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 16:50:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-07 16:50:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 16:50:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-07 16:50:15,224 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2018-11-07 16:50:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:15,224 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-07 16:50:15,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:50:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-07 16:50:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 16:50:15,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:15,225 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:15,226 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:15,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2078995811, now seen corresponding path program 14 times [2018-11-07 16:50:15,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:15,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:15,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:15,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:15,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:15,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:15,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:15,933 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:15,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:15,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:15,933 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 16:50:15,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:15,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:15,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:50:15,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:15,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 16:50:16,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 16:50:17,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:17,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 11] total 41 [2018-11-07 16:50:17,127 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:17,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:50:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:50:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 16:50:17,129 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 32 states. [2018-11-07 16:50:26,316 WARN L179 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 16:50:30,325 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 16:50:35,008 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 16:51:01,559 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 16:51:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:51:08,598 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2018-11-07 16:51:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:51:08,598 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-07 16:51:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:51:08,599 INFO L225 Difference]: With dead ends: 123 [2018-11-07 16:51:08,599 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 16:51:08,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=590, Invalid=1754, Unknown=8, NotChecked=0, Total=2352 [2018-11-07 16:51:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 16:51:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2018-11-07 16:51:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 16:51:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-07 16:51:08,612 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 80 [2018-11-07 16:51:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:51:08,612 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-07 16:51:08,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:51:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-07 16:51:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 16:51:08,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:51:08,618 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:51:08,618 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:51:08,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:51:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 59221243, now seen corresponding path program 15 times [2018-11-07 16:51:08,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:51:08,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:08,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:51:08,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:08,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:51:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:09,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:09,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:51:09,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:51:09,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:51:09,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:09,188 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 16:51:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:51:09,196 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:51:09,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:51:09,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:51:09,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:51:09,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:51:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:51:11,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:51:11,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 23] total 49 [2018-11-07 16:51:11,379 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:51:11,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:51:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:51:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 16:51:11,381 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 28 states. [2018-11-07 16:51:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:51:12,063 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-07 16:51:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:51:12,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 16:51:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:51:12,064 INFO L225 Difference]: With dead ends: 118 [2018-11-07 16:51:12,065 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 16:51:12,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 16:51:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 16:51:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-07 16:51:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 16:51:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-11-07 16:51:12,073 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 86 [2018-11-07 16:51:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:51:12,074 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-11-07 16:51:12,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:51:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-07 16:51:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 16:51:12,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:51:12,075 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:51:12,075 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:51:12,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:51:12,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1341754853, now seen corresponding path program 16 times [2018-11-07 16:51:12,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:51:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:12,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:51:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:12,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:51:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:12,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:12,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:51:12,648 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:51:12,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:51:12,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:12,648 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 16:51:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:51:12,657 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:51:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:12,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:51:12,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:51:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:51:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:51:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 53 [2018-11-07 16:51:15,429 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:51:15,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:51:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:51:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 16:51:15,431 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 30 states. [2018-11-07 16:51:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:51:16,337 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-07 16:51:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:51:16,338 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-07 16:51:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:51:16,339 INFO L225 Difference]: With dead ends: 124 [2018-11-07 16:51:16,339 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 16:51:16,341 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 16:51:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 16:51:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-07 16:51:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 16:51:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-07 16:51:16,350 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 92 [2018-11-07 16:51:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:51:16,350 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-07 16:51:16,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:51:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-07 16:51:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 16:51:16,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:51:16,351 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:51:16,351 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:51:16,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:51:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2143361221, now seen corresponding path program 17 times [2018-11-07 16:51:16,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:51:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:16,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:51:16,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:16,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:51:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:16,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:16,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:51:16,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:51:16,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:51:16,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:16,995 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 16:51:17,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:51:17,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:51:17,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 16:51:17,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:51:17,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 16:51:17,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:51:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 16:51:18,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:51:18,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 12] total 49 [2018-11-07 16:51:18,156 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:51:18,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:51:18,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:51:18,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 16:51:18,158 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 39 states. [2018-11-07 16:51:21,577 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2018-11-07 16:51:26,018 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 16:51:39,939 WARN L179 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 16:51:49,990 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 16:51:54,259 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 16:52:13,844 WARN L179 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 16:52:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:30,287 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-11-07 16:52:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 16:52:30,287 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 98 [2018-11-07 16:52:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:30,288 INFO L225 Difference]: With dead ends: 143 [2018-11-07 16:52:30,288 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 16:52:30,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 184 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=803, Invalid=2384, Unknown=9, NotChecked=110, Total=3306 [2018-11-07 16:52:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 16:52:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-11-07 16:52:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 16:52:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-11-07 16:52:30,298 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 98 [2018-11-07 16:52:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:30,298 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-11-07 16:52:30,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:52:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-07 16:52:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 16:52:30,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:30,299 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:30,299 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:30,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1159676448, now seen corresponding path program 18 times [2018-11-07 16:52:30,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:30,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:30,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 155 proven. 1395 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:52:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:31,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:31,086 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:31,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:31,086 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 16:52:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:52:31,095 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:52:31,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:52:31,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:31,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:52:31,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:52:33,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:33,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 29] total 61 [2018-11-07 16:52:33,886 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:33,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:52:33,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:52:33,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:52:33,887 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 34 states. [2018-11-07 16:52:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:35,095 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-07 16:52:35,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:52:35,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2018-11-07 16:52:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:35,099 INFO L225 Difference]: With dead ends: 142 [2018-11-07 16:52:35,099 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 16:52:35,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:52:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 16:52:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-07 16:52:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 16:52:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-11-07 16:52:35,110 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 107 [2018-11-07 16:52:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:35,110 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-11-07 16:52:35,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:52:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-07 16:52:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 16:52:35,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:35,111 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:35,111 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:35,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -628496128, now seen corresponding path program 19 times [2018-11-07 16:52:35,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:35,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:35,113 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 165 proven. 1584 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:52:35,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:35,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:35,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:35,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:35,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:35,851 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 16:52:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:35,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:52:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:35,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:52:36,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:52:39,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30, 31] total 65 [2018-11-07 16:52:39,524 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:39,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:52:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:52:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=3013, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 16:52:39,527 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 36 states. [2018-11-07 16:52:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:41,038 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-11-07 16:52:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:52:41,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2018-11-07 16:52:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:41,040 INFO L225 Difference]: With dead ends: 148 [2018-11-07 16:52:41,040 INFO L226 Difference]: Without dead ends: 120 [2018-11-07 16:52:41,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1147, Invalid=3013, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 16:52:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-07 16:52:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-07 16:52:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 16:52:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2018-11-07 16:52:41,052 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 113 [2018-11-07 16:52:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:41,052 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2018-11-07 16:52:41,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:52:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-07 16:52:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 16:52:41,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:41,053 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:41,054 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:41,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash -866916384, now seen corresponding path program 20 times [2018-11-07 16:52:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:41,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:41,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 175 proven. 1785 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:52:42,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:42,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:42,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:42,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:42,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:42,376 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 16:52:42,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:52:42,385 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:52:42,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:52:42,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:42,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 667 proven. 77 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 16:52:42,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 667 proven. 77 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 16:52:43,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:43,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 10, 13] total 57 [2018-11-07 16:52:43,467 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:43,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 16:52:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 16:52:43,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2477, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 16:52:43,468 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 46 states. [2018-11-07 16:52:48,431 WARN L179 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2018-11-07 16:53:07,094 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-07 16:53:15,063 WARN L179 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 16:53:22,284 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 16:53:27,179 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 Received shutdown request... [2018-11-07 16:53:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:53:46,916 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:53:46,920 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:53:46,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:53:46 BoogieIcfgContainer [2018-11-07 16:53:46,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:53:46,921 INFO L168 Benchmark]: Toolchain (without parser) took 277526.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 914.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -286.8 MB). Peak memory consumption was 628.0 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,922 INFO L168 Benchmark]: CDTParser took 0.21 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 16:53:46,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.77 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 16:53:46,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.88 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 16:53:46,924 INFO L168 Benchmark]: Boogie Preprocessor took 25.29 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 16:53:46,924 INFO L168 Benchmark]: RCFGBuilder took 348.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -755.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,925 INFO L168 Benchmark]: TraceAbstraction took 276839.92 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 208.1 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 457.7 MB). Peak memory consumption was 665.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,929 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.77 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.88 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 25.29 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 348.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -755.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 276839.92 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 208.1 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 457.7 MB). Peak memory consumption was 665.9 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 constructing difference of abstraction (120states) and FLOYD_HOARE automaton (currently 42 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 66 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 276.7s OverallTime, 24 OverallIterations, 37 TraceHistogramMax, 234.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 567 SDtfs, 470 SDslu, 8437 SDs, 0 SdLazy, 14089 SolverSat, 668 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 73.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3136 GetRequests, 2348 SyntacticMatches, 60 SemanticMatches, 727 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 194.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 2671 NumberOfCodeBlocks, 2419 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 3928 ConstructedInterpolants, 0 QuantifiedInterpolants, 1874038 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1891 ConjunctsInSsa, 563 ConjunctsInUnsatCore, 68 InterpolantComputations, 4 PerfectInterpolantSequences, 15755/38544 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown