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.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:59:44,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:59:44,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:59:44,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:59:44,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:59:44,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:59:44,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:59:44,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:59:44,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:59:44,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:59:44,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:59:44,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:59:44,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:59:44,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:59:44,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:59:44,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:59:44,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:59:44,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:59:44,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:59:44,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:59:44,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:59:44,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:59:44,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:59:44,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:59:44,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:59:44,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:59:44,059 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:59:44,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:59:44,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:59:44,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:59:44,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:59:44,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:59:44,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:59:44,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:59:44,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:59:44,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:59:44,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:59:44,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:59:44,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:59:44,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:59:44,088 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:59:44,088 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:59:44,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:59:44,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:59:44,089 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:59:44,089 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:59:44,089 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:59:44,089 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:59:44,089 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:59:44,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:59:44,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:59:44,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:59:44,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:59:44,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:59:44,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:59:44,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:59:44,094 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:59:44,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:59:44,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:59:44,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:59:44,095 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:59:44,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:59:44,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:59:44,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:59:44,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:59:44,096 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:59:44,096 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:59:44,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:59:44,097 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:59:44,097 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:59:44,097 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:59:44,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:59:44,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:59:44,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:59:44,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:59:44,170 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:59:44,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-07 04:59:44,237 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318cc3508/6255a27edbdf45b3a010a27f5817a388/FLAG0d5933c92 [2018-11-07 04:59:44,711 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:59:44,712 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-07 04:59:44,719 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318cc3508/6255a27edbdf45b3a010a27f5817a388/FLAG0d5933c92 [2018-11-07 04:59:44,736 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318cc3508/6255a27edbdf45b3a010a27f5817a388 [2018-11-07 04:59:44,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:59:44,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:59:44,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:44,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:59:44,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:59:44,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:44" (1/1) ... [2018-11-07 04:59:44,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafbaf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:44, skipping insertion in model container [2018-11-07 04:59:44,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:44" (1/1) ... [2018-11-07 04:59:44,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:59:44,794 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:59:44,979 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:44,984 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:59:45,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:45,018 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:59:45,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45 WrapperNode [2018-11-07 04:59:45,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:45,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:45,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:59:45,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:59:45,032 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:59:45" (1/1) ... [2018-11-07 04:59:45,038 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:59:45" (1/1) ... [2018-11-07 04:59:45,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:45,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:59:45,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:59:45,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:59:45,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (1/1) ... [2018-11-07 04:59:45,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:59:45,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:59:45,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:59:45,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:59:45,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (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 04:59:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:59:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:59:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:59:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:59:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:59:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:59:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:59:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:59:45,461 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:59:45,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:45 BoogieIcfgContainer [2018-11-07 04:59:45,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:59:45,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:59:45,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:59:45,466 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:59:45,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:59:44" (1/3) ... [2018-11-07 04:59:45,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66949a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:45, skipping insertion in model container [2018-11-07 04:59:45,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:45" (2/3) ... [2018-11-07 04:59:45,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66949a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:45, skipping insertion in model container [2018-11-07 04:59:45,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:45" (3/3) ... [2018-11-07 04:59:45,470 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call1.i [2018-11-07 04:59:45,480 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:59:45,488 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:59:45,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:59:45,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:59:45,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:59:45,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:59:45,540 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:59:45,540 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:59:45,540 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:59:45,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:59:45,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:59:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 04:59:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 04:59:45,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:45,567 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:45,570 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:45,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 04:59:45,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:45,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:45,689 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 04:59:45,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:45,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:59:45,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:45,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:59:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:59:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:59:45,715 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 04:59:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:45,739 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 04:59:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:59:45,741 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 04:59:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:45,750 INFO L225 Difference]: With dead ends: 29 [2018-11-07 04:59:45,750 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 04:59:45,754 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 04:59:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 04:59:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 04:59:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 04:59:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 04:59:45,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 04:59:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:45,795 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 04:59:45,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:59:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 04:59:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 04:59:45,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:45,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:45,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:45,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 04:59:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:45,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:45,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:45,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:45,968 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 04:59:45,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:45,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:59:45,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:45,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:59:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:59:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:59:45,972 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 04:59:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:46,033 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 04:59:46,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:59:46,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 04:59:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:46,035 INFO L225 Difference]: With dead ends: 19 [2018-11-07 04:59:46,035 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 04:59:46,036 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 04:59:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 04:59:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 04:59:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 04:59:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 04:59:46,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 04:59:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:46,041 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 04:59:46,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:59:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 04:59:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:59:46,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:46,042 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:46,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:46,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 04:59:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:46,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:46,173 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 04:59:46,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:46,174 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:46,175 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 04:59:46,177 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 04:59:46,232 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:59:46,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:59:46,340 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:59:46,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:59:46,696 INFO L272 AbstractInterpreter]: Visited 12 different actions 74 times. Merged at 3 different actions 28 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 04:59:46,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:46,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:59:46,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:46,719 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 04:59:46,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:46,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:46,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:46,810 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 04:59:46,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:46,925 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 04:59:46,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:46,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 04:59:46,948 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:46,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:59:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:59:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:59:46,949 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 04:59:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:46,966 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 04:59:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:59:46,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 04:59:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:46,968 INFO L225 Difference]: With dead ends: 21 [2018-11-07 04:59:46,968 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 04:59:46,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:59:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 04:59:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 04:59:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 04:59:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 04:59:46,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 04:59:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:46,975 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 04:59:46,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:59:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 04:59:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 04:59:46,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:46,976 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:46,976 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:46,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 04:59:46,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:46,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:46,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:46,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:46,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:47,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:47,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:47,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:47,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:47,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:47,129 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 04:59:47,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:47,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:47,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:59:47,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:47,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:47,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:47,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:47,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 04:59:47,567 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:47,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:59:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:59:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:59:47,569 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 04:59:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:47,632 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 04:59:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:59:47,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 04:59:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:47,634 INFO L225 Difference]: With dead ends: 23 [2018-11-07 04:59:47,634 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 04:59:47,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:59:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 04:59:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 04:59:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 04:59:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 04:59:47,639 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 04:59:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:47,639 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 04:59:47,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:59:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 04:59:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 04:59:47,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:47,641 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:47,641 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:47,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 04:59:47,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:47,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:47,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:47,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:47,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:47,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:47,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:47,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:47,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:47,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:47,773 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 04:59:47,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:47,781 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:47,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:47,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:47,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:47,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:48,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:48,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 04:59:48,131 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:48,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:59:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:59:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:59:48,133 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 04:59:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:48,183 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 04:59:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:59:48,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 04:59:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:48,185 INFO L225 Difference]: With dead ends: 25 [2018-11-07 04:59:48,185 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 04:59:48,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:59:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 04:59:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 04:59:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 04:59:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 04:59:48,191 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 04:59:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:48,191 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 04:59:48,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:59:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 04:59:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:59:48,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:48,192 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:48,193 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:48,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 04:59:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:48,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:48,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:48,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:48,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:48,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:48,357 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:48,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:48,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:48,357 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 04:59:48,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:48,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:48,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:48,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 04:59:48,820 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:59:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:59:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:59:48,822 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 04:59:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:48,873 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 04:59:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:59:48,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 04:59:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:48,874 INFO L225 Difference]: With dead ends: 27 [2018-11-07 04:59:48,874 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 04:59:48,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:59:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 04:59:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 04:59:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 04:59:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 04:59:48,880 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 04:59:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:48,880 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 04:59:48,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:59:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 04:59:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 04:59:48,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:48,881 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:48,881 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:48,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 04:59:48,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:48,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:48,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:48,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:48,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:49,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:49,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:49,086 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:49,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 04:59:49,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:49,087 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 04:59:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:49,095 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:49,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:59:49,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:49,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:49,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:49,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:49,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 04:59:49,452 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:49,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:59:49,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:59:49,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:59:49,453 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 04:59:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:49,524 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 04:59:49,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:59:49,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 04:59:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:49,528 INFO L225 Difference]: With dead ends: 29 [2018-11-07 04:59:49,528 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 04:59:49,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:59:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 04:59:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 04:59:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 04:59:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 04:59:49,534 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 04:59:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:49,534 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 04:59:49,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:59:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 04:59:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 04:59:49,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:49,535 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:49,536 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:49,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 04:59:49,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:49,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:49,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:49,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:49,745 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:49,745 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:49,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:49,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:49,746 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 04:59:49,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:49,756 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:49,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:49,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:49,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:49,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 04:59:50,074 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:50,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:59:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:59:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:59:50,078 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-07 04:59:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:50,147 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 04:59:50,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:59:50,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 04:59:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:50,149 INFO L225 Difference]: With dead ends: 31 [2018-11-07 04:59:50,149 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 04:59:50,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:59:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 04:59:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 04:59:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 04:59:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-07 04:59:50,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-07 04:59:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:50,155 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-07 04:59:50,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:59:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-07 04:59:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 04:59:50,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:50,156 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:50,156 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:50,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-07 04:59:50,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:50,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:50,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:50,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:50,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:50,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:50,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:50,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:50,325 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 04:59:50,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:50,333 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:50,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:50,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:50,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:50,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 04:59:50,733 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:50,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:59:50,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:59:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:59:50,736 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-07 04:59:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:50,856 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 04:59:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:59:50,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-07 04:59:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:50,861 INFO L225 Difference]: With dead ends: 33 [2018-11-07 04:59:50,861 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 04:59:50,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:59:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 04:59:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 04:59:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 04:59:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-07 04:59:50,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-07 04:59:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:50,867 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-07 04:59:50,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:59:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-07 04:59:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 04:59:50,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:50,868 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:50,868 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:50,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-07 04:59:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:50,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:50,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:51,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:51,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:51,063 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:51,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:51,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:51,063 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 04:59:51,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:51,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:14,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 05:00:14,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:14,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:14,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:14,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:14,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 05:00:14,665 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:14,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:00:14,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:00:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:00:14,667 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-07 05:00:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:14,771 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 05:00:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:00:14,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-07 05:00:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:14,773 INFO L225 Difference]: With dead ends: 35 [2018-11-07 05:00:14,773 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 05:00:14,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:00:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 05:00:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 05:00:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 05:00:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 05:00:14,778 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-07 05:00:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:14,779 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 05:00:14,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:00:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 05:00:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 05:00:14,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:14,780 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:14,780 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:14,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-07 05:00:14,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:14,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:14,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:15,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:15,038 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:15,039 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:15,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:15,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:15,039 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 05:00:15,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:15,048 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:15,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:15,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:15,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:15,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:15,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 05:00:15,388 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:15,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:00:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:00:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:00:15,390 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-07 05:00:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:15,545 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-07 05:00:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:00:15,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-07 05:00:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:15,547 INFO L225 Difference]: With dead ends: 37 [2018-11-07 05:00:15,548 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 05:00:15,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:00:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 05:00:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 05:00:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 05:00:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-07 05:00:15,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-07 05:00:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:15,553 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-07 05:00:15,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:00:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-07 05:00:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 05:00:15,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:15,554 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:15,555 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:15,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-07 05:00:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:15,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:15,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:15,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:15,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:15,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:15,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:15,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:15,957 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 05:00:15,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:15,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:15,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 05:00:16,472 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:16,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:00:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:00:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:00:16,474 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-07 05:00:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:16,583 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 05:00:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:00:16,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-07 05:00:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:16,585 INFO L225 Difference]: With dead ends: 39 [2018-11-07 05:00:16,585 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 05:00:16,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:00:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 05:00:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 05:00:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 05:00:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-07 05:00:16,592 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-07 05:00:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:16,592 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-07 05:00:16,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:00:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-07 05:00:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 05:00:16,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:16,594 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:16,594 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:16,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-07 05:00:16,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:16,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:16,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:16,868 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:16,868 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:16,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:16,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:16,869 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 05:00:16,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:16,877 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:01:33,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 05:01:33,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:33,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:33,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 130 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:59,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 05:01:59,728 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:01:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:01:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=447, Unknown=10, NotChecked=0, Total=650 [2018-11-07 05:01:59,729 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-07 05:01:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:59,921 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-07 05:01:59,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:01:59,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-07 05:01:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:59,923 INFO L225 Difference]: With dead ends: 41 [2018-11-07 05:01:59,923 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 05:01:59,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=193, Invalid=447, Unknown=10, NotChecked=0, Total=650 [2018-11-07 05:01:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 05:01:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 05:01:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 05:01:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 05:01:59,927 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-07 05:01:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:59,928 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 05:01:59,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:01:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 05:01:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 05:01:59,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:59,929 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:59,929 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:59,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-07 05:01:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:59,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:59,931 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:00,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:00,510 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:00,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:00,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:00,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:00,510 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 05:02:00,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:02:00,521 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:02:00,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:02:00,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:00,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:00,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:01,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 05:02:01,146 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:01,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 05:02:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 05:02:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:02:01,147 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-07 05:02:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:01,348 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 05:02:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:02:01,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-07 05:02:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:01,355 INFO L225 Difference]: With dead ends: 43 [2018-11-07 05:02:01,355 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 05:02:01,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:02:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 05:02:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 05:02:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 05:02:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-07 05:02:01,360 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-07 05:02:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:01,360 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-07 05:02:01,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 05:02:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-07 05:02:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 05:02:01,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:01,362 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:01,362 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:01,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-07 05:02:01,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:01,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:01,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:01,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:01,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:01,722 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:01,722 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:01,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:01,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:01,722 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 05:02:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:01,731 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:02:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:01,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:01,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:02,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:02,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 05:02:02,376 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:02,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:02:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:02:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:02:02,378 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-07 05:02:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:02,539 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 05:02:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:02:02,539 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-07 05:02:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:02,540 INFO L225 Difference]: With dead ends: 45 [2018-11-07 05:02:02,541 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 05:02:02,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:02:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 05:02:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 05:02:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 05:02:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-07 05:02:02,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-07 05:02:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:02,547 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-07 05:02:02,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:02:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-07 05:02:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 05:02:02,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:02,548 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:02,548 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:02,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-07 05:02:02,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:02,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:03,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:03,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:03,004 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:03,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:03,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:03,004 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 05:02:03,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:02:03,018 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:02:14,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 05:02:14,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:14,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:14,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:14,729 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 6 [2018-11-07 05:02:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 206 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:20,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:20,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 35 [2018-11-07 05:02:20,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:20,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:02:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:02:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=881, Unknown=2, NotChecked=0, Total=1190 [2018-11-07 05:02:20,465 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-07 05:02:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:20,652 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 05:02:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:02:20,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 05:02:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:20,653 INFO L225 Difference]: With dead ends: 47 [2018-11-07 05:02:20,654 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 05:02:20,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=307, Invalid=881, Unknown=2, NotChecked=0, Total=1190 [2018-11-07 05:02:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 05:02:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 05:02:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:02:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 05:02:20,661 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-07 05:02:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:20,661 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 05:02:20,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:02:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 05:02:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:02:20,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:20,662 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:20,662 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:20,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-07 05:02:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:20,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:20,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:20,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:20,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:21,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:21,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:21,197 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:21,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:21,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:21,198 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 05:02:21,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:02:21,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:02:21,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:02:21,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:21,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:21,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:21,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:21,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:02:21,867 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:21,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:02:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:02:21,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:02:21,868 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-07 05:02:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:22,125 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-07 05:02:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:02:22,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-07 05:02:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:22,126 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:02:22,126 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 05:02:22,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:02:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 05:02:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 05:02:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 05:02:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-07 05:02:22,133 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-07 05:02:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:22,133 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-07 05:02:22,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:02:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-07 05:02:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 05:02:22,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:22,135 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:22,135 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:22,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:22,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-07 05:02:22,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:22,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:22,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:22,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:22,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:22,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:22,589 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:22,589 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:22,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:22,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:22,589 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 05:02:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:22,600 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:02:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:22,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:22,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:23,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:23,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:02:23,360 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:23,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:02:23,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:02:23,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:02:23,361 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-07 05:02:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:23,726 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 05:02:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:02:23,727 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-07 05:02:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:23,728 INFO L225 Difference]: With dead ends: 51 [2018-11-07 05:02:23,728 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 05:02:23,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:02:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 05:02:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 05:02:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 05:02:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-07 05:02:23,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-07 05:02:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:23,734 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-07 05:02:23,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:02:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-07 05:02:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 05:02:23,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:23,735 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:23,736 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:23,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-07 05:02:23,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:23,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:23,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:24,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:24,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:24,101 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:24,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:24,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:24,101 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 05:02:24,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:02:24,110 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown