java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:47:14,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:47:14,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:47:14,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:47:14,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:47:14,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:47:15,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:47:15,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:47:15,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:47:15,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:47:15,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:47:15,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:47:15,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:47:15,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:47:15,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:47:15,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:47:15,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:47:15,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:47:15,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:47:15,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:47:15,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:47:15,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:47:15,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:47:15,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:47:15,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:47:15,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:47:15,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:47:15,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:47:15,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:47:15,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:47:15,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:47:15,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:47:15,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:47:15,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:47:15,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:47:15,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:47:15,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:47:15,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:47:15,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:47:15,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:47:15,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:47:15,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 12:47:15,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:47:15,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:47:15,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:47:15,069 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:47:15,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:47:15,070 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:47:15,070 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:47:15,070 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:47:15,070 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:47:15,071 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:47:15,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:47:15,071 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:47:15,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:47:15,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:47:15,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:47:15,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:47:15,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:47:15,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:47:15,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:47:15,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:47:15,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:47:15,073 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:47:15,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:47:15,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:47:15,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:47:15,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:47:15,075 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:47:15,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:47:15,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:47:15,075 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:47:15,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:47:15,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:47:15,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:47:15,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:47:15,126 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:47:15,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-05 12:47:15,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81df078b9/07c0628dc6cc4fb29d292a87e2712e7e/FLAGbda141773 [2019-09-05 12:47:15,601 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:47:15,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-05 12:47:15,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81df078b9/07c0628dc6cc4fb29d292a87e2712e7e/FLAGbda141773 [2019-09-05 12:47:16,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81df078b9/07c0628dc6cc4fb29d292a87e2712e7e [2019-09-05 12:47:16,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:47:16,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:47:16,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:47:16,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:47:16,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:47:16,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d21465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16, skipping insertion in model container [2019-09-05 12:47:16,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,029 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:47:16,043 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:47:16,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:47:16,203 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:47:16,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:47:16,235 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:47:16,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16 WrapperNode [2019-09-05 12:47:16,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:47:16,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:47:16,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:47:16,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:47:16,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... [2019-09-05 12:47:16,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:47:16,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:47:16,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:47:16,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:47:16,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:47:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:47:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:47:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:47:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:47:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:47:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:47:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:47:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:47:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:47:16,551 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:47:16,551 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:47:16,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:47:16 BoogieIcfgContainer [2019-09-05 12:47:16,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:47:16,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:47:16,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:47:16,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:47:16,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:47:16" (1/3) ... [2019-09-05 12:47:16,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e35f0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:47:16, skipping insertion in model container [2019-09-05 12:47:16,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:47:16" (2/3) ... [2019-09-05 12:47:16,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e35f0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:47:16, skipping insertion in model container [2019-09-05 12:47:16,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:47:16" (3/3) ... [2019-09-05 12:47:16,561 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2019-09-05 12:47:16,570 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:47:16,577 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:47:16,593 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:47:16,614 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:47:16,614 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:47:16,614 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:47:16,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:47:16,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:47:16,614 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:47:16,615 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:47:16,615 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:47:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 12:47:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:47:16,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:16,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:16,638 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 12:47:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:16,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:16,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:47:16,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:47:16,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:47:16,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:47:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:47:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:47:16,763 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 12:47:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:16,777 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-05 12:47:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:47:16,778 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:47:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:16,787 INFO L225 Difference]: With dead ends: 18 [2019-09-05 12:47:16,787 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 12:47:16,789 INFO L628 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 [2019-09-05 12:47:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 12:47:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 12:47:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 12:47:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 12:47:16,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 12:47:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:16,826 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 12:47:16,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:47:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 12:47:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:47:16,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:16,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:16,828 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 12:47:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:16,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:16,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:47:16,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:47:16,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:47:16,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:47:16,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:47:16,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:47:16,969 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 12:47:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:16,992 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-05 12:47:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:47:16,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:47:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:16,994 INFO L225 Difference]: With dead ends: 14 [2019-09-05 12:47:16,994 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 12:47:16,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:47:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 12:47:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 12:47:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 12:47:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 12:47:16,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 12:47:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:16,999 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 12:47:16,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:47:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 12:47:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 12:47:17,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:17,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:17,000 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 12:47:17,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:17,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:17,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:17,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:17,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:17,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-05 12:47:17,194 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 12:47:17,227 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:47:17,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:47:17,288 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:47:17,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:47:17,839 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 3 different actions 18 times. Widened at 1 different actions 4 times. Performed 88 root evaluator evaluations with a maximum evaluation depth of 13. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-05 12:47:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:17,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:47:17,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:17,846 INFO L193 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) [2019-09-05 12:47:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:17,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:17,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 12:47:17,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:17,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:18,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-05 12:47:18,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:18,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:47:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:47:18,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:47:18,019 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-05 12:47:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:18,065 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-05 12:47:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:47:18,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 12:47:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:18,067 INFO L225 Difference]: With dead ends: 16 [2019-09-05 12:47:18,067 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 12:47:18,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:47:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 12:47:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 12:47:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 12:47:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-05 12:47:18,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-05 12:47:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:18,072 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-05 12:47:18,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:47:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-05 12:47:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:47:18,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:18,074 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:18,074 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 12:47:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:18,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:18,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:18,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:18,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:18,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:18,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:18,191 INFO L193 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) [2019-09-05 12:47:18,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:18,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:18,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 12:47:18,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:18,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 12:47:18,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 12:47:18,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 12:47:18,276 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:47:18,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-09-05 12:47:18,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:47:18,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:47:18,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:47:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:47:18,278 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-05 12:47:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:18,299 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-05 12:47:18,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:47:18,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 12:47:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:18,301 INFO L225 Difference]: With dead ends: 18 [2019-09-05 12:47:18,302 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 12:47:18,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:47:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 12:47:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-05 12:47:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 12:47:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 12:47:18,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-05 12:47:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:18,310 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 12:47:18,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:47:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 12:47:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:47:18,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:18,311 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:18,313 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-05 12:47:18,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:18,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:18,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:18,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:18,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:18,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-05 12:47:18,457 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 12:47:18,460 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:47:18,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:47:18,463 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:47:18,732 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:47:18,732 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 104 root evaluator evaluations with a maximum evaluation depth of 13. Performed 104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-05 12:47:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:18,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:47:18,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:18,733 INFO L193 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) [2019-09-05 12:47:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:18,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:18,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 12:47:18,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:18,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:18,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:18,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-05 12:47:18,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:18,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:47:18,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:47:18,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:47:18,903 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-05 12:47:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:18,951 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 12:47:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:47:18,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-05 12:47:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:18,954 INFO L225 Difference]: With dead ends: 19 [2019-09-05 12:47:18,954 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 12:47:18,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:47:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 12:47:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 12:47:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 12:47:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-05 12:47:18,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-05 12:47:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:18,961 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-05 12:47:18,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:47:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-05 12:47:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:47:18,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:18,962 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:18,962 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-05 12:47:18,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:18,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:18,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:19,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:19,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:19,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:19,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,060 INFO L193 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 [2019-09-05 12:47:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:19,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:47:19,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 12:47:19,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:19,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 12:47:19,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 12:47:19,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 12:47:19,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:19,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2019-09-05 12:47:19,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:19,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:47:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:47:19,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:47:19,165 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-05 12:47:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:19,351 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-05 12:47:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:47:19,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 12:47:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:19,353 INFO L225 Difference]: With dead ends: 26 [2019-09-05 12:47:19,353 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 12:47:19,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:47:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 12:47:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-05 12:47:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 12:47:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-05 12:47:19,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-05 12:47:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:19,358 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-05 12:47:19,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:47:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-05 12:47:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 12:47:19,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:19,360 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:19,360 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:19,360 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-05 12:47:19,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:19,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:19,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:19,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:19,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:19,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:19,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:19,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:19,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,514 INFO L193 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) [2019-09-05 12:47:19,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:19,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:19,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:19,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:19,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 12:47:19,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:19,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:19,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:19,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-05 12:47:19,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:19,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:47:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:47:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:47:19,786 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-05 12:47:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:19,869 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-05 12:47:19,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:47:19,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-05 12:47:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:19,870 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:47:19,870 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 12:47:19,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:47:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 12:47:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 12:47:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 12:47:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-05 12:47:19,874 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2019-09-05 12:47:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:19,874 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-05 12:47:19,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:47:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-05 12:47:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:47:19,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:19,876 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:19,876 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-05 12:47:19,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:19,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:19,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:19,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:19,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:19,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,992 INFO L193 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 [2019-09-05 12:47:20,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:20,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:47:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:20,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 12:47:20,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:20,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:20,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:20,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-05 12:47:20,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:20,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:47:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:47:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:47:20,380 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-05 12:47:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:20,480 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-05 12:47:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:47:20,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-05 12:47:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:20,482 INFO L225 Difference]: With dead ends: 27 [2019-09-05 12:47:20,483 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 12:47:20,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:47:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 12:47:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 12:47:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 12:47:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-05 12:47:20,489 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-05 12:47:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:20,489 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-05 12:47:20,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:47:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-05 12:47:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:47:20,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:20,491 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:20,491 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-05 12:47:20,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:20,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:20,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:47:20,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:20,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:20,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:20,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:20,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:20,666 INFO L193 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) [2019-09-05 12:47:20,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:20,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:20,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 12:47:20,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:20,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 12:47:20,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 12:47:20,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 12:47:20,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:20,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2019-09-05 12:47:20,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:20,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:47:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:47:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:47:20,839 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2019-09-05 12:47:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:25,332 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-05 12:47:25,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:47:25,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 12:47:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:25,333 INFO L225 Difference]: With dead ends: 36 [2019-09-05 12:47:25,334 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 12:47:25,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:47:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 12:47:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-09-05 12:47:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:47:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-05 12:47:25,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2019-09-05 12:47:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:25,339 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-05 12:47:25,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:47:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-05 12:47:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 12:47:25,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:25,342 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:25,342 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-05 12:47:25,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:25,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:25,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:25,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:25,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:25,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:25,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:25,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:25,482 INFO L193 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) [2019-09-05 12:47:25,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:25,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:25,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:25,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:25,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 12:47:25,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:25,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:25,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:25,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-05 12:47:25,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:25,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:47:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:47:25,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:47:25,861 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-09-05 12:47:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:26,011 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-05 12:47:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:47:26,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-05 12:47:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:26,014 INFO L225 Difference]: With dead ends: 33 [2019-09-05 12:47:26,014 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 12:47:26,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:47:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 12:47:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 12:47:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:47:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-05 12:47:26,019 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2019-09-05 12:47:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:26,019 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-05 12:47:26,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:47:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-05 12:47:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:47:26,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:26,020 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:26,021 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:26,021 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-05 12:47:26,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:26,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:26,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:26,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:26,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:26,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:26,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:26,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:26,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:26,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:26,173 INFO L193 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 [2019-09-05 12:47:26,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:26,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:47:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:26,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:47:26,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:26,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:26,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:26,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-05 12:47:26,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:26,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:47:26,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:47:26,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:47:26,948 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2019-09-05 12:47:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:27,152 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-05 12:47:27,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:47:27,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-05 12:47:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:27,158 INFO L225 Difference]: With dead ends: 35 [2019-09-05 12:47:27,158 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 12:47:27,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:47:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 12:47:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 12:47:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 12:47:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-05 12:47:27,163 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2019-09-05 12:47:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:27,164 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-05 12:47:27,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:47:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-05 12:47:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 12:47:27,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:27,165 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:27,165 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-05 12:47:27,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:27,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:27,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:47:27,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:27,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:27,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:27,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:27,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:27,370 INFO L193 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 [2019-09-05 12:47:27,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:27,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:47:27,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 12:47:27,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:27,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 12:47:27,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 12:47:27,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 12:47:27,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:27,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2019-09-05 12:47:27,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:27,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:47:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:47:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:47:27,610 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-09-05 12:47:28,599 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 12:47:31,788 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-05 12:47:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:34,271 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-05 12:47:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:47:34,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 12:47:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:34,272 INFO L225 Difference]: With dead ends: 42 [2019-09-05 12:47:34,272 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 12:47:34,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-05 12:47:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 12:47:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-05 12:47:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 12:47:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 12:47:34,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2019-09-05 12:47:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:34,277 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 12:47:34,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:47:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 12:47:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:47:34,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:34,278 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:34,278 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:34,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-05 12:47:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:34,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:34,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:34,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:34,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:34,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:34,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:34,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:34,459 INFO L193 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 [2019-09-05 12:47:34,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:34,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:47:34,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:34,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:34,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:47:34,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:34,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:35,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:35,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-05 12:47:35,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:35,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:47:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:47:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:47:35,325 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-05 12:47:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:35,594 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-05 12:47:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:47:35,600 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-05 12:47:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:35,600 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:47:35,601 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 12:47:35,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:47:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 12:47:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 12:47:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 12:47:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-05 12:47:35,606 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-05 12:47:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:35,606 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-05 12:47:35,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:47:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-05 12:47:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:47:35,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:35,608 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:35,608 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-05 12:47:35,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:35,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:35,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:35,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:35,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:35,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:35,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:35,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:35,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:35,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:35,850 INFO L193 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) [2019-09-05 12:47:35,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:35,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:35,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:47:35,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:35,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:36,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:36,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-05 12:47:36,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:36,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:47:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:47:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:47:36,840 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 15 states. [2019-09-05 12:47:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:37,168 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-05 12:47:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:47:37,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-05 12:47:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:37,170 INFO L225 Difference]: With dead ends: 43 [2019-09-05 12:47:37,170 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 12:47:37,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:47:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 12:47:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 12:47:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 12:47:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 12:47:37,174 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-05 12:47:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:37,175 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 12:47:37,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:47:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 12:47:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:47:37,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:37,176 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:37,176 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:37,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-05 12:47:37,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:37,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 12:47:37,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:37,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:37,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:37,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:37,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:37,404 INFO L193 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 [2019-09-05 12:47:37,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:37,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:47:37,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 12:47:37,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:37,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 12:47:37,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 12:47:38,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:47:38,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:38,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 25 [2019-09-05 12:47:38,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:38,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:47:38,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:47:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:47:38,268 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-05 12:47:41,224 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 12:47:43,962 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 12:47:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:51,306 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-05 12:47:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:47:51,307 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 12:47:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:51,307 INFO L225 Difference]: With dead ends: 52 [2019-09-05 12:47:51,308 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 12:47:51,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=281, Invalid=648, Unknown=1, NotChecked=0, Total=930 [2019-09-05 12:47:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 12:47:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-09-05 12:47:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 12:47:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-05 12:47:51,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-05 12:47:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:51,313 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-05 12:47:51,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:47:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-05 12:47:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:47:51,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:51,314 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:51,314 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-05 12:47:51,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:51,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:51,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 12:47:51,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:51,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:51,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:51,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:51,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:51,575 INFO L193 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 [2019-09-05 12:47:51,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:51,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:47:51,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:51,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:51,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:47:51,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 12:47:51,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 12:47:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:52,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-05 12:47:52,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:52,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:47:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:47:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:47:52,806 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-05 12:47:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:53,211 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-05 12:47:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:47:53,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-05 12:47:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:53,213 INFO L225 Difference]: With dead ends: 49 [2019-09-05 12:47:53,213 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 12:47:53,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:47:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 12:47:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-05 12:47:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 12:47:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-05 12:47:53,218 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-05 12:47:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:53,219 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-05 12:47:53,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:47:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-05 12:47:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 12:47:53,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:53,220 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:53,220 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-05 12:47:53,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:53,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:53,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:53,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:53,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 12:47:53,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:53,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:53,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:53,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:53,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:53,500 INFO L193 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) [2019-09-05 12:47:53,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:53,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:53,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:47:53,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 12:47:53,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:47:54,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:54,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-05 12:47:54,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:54,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:47:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:47:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:47:54,714 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-09-05 12:47:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:55,114 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-05 12:47:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:47:55,115 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-05 12:47:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:55,115 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:47:55,116 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 12:47:55,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:47:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 12:47:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-05 12:47:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 12:47:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-05 12:47:55,124 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-05 12:47:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:55,125 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-05 12:47:55,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:47:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-05 12:47:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:47:55,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:55,126 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:55,126 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-05 12:47:55,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:55,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 12:47:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:55,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:55,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:55,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:55,406 INFO L193 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 [2019-09-05 12:47:55,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:55,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:48:24,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 12:48:24,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:24,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 12:48:24,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 23 refuted. 2 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 12:48:27,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 12:48:28,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 31 [2019-09-05 12:48:28,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:28,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:48:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:48:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=664, Unknown=1, NotChecked=0, Total=930 [2019-09-05 12:48:28,049 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2019-09-05 12:48:41,201 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 12:48:53,994 WARN L188 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 12:48:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:59,219 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-09-05 12:48:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:48:59,220 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 12:48:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:59,220 INFO L225 Difference]: With dead ends: 58 [2019-09-05 12:48:59,220 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 12:48:59,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=358, Invalid=967, Unknown=7, NotChecked=0, Total=1332 [2019-09-05 12:48:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 12:48:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-09-05 12:48:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 12:48:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-05 12:48:59,226 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 50 [2019-09-05 12:48:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:59,226 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-05 12:48:59,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:48:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-05 12:48:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:48:59,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:59,228 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:59,228 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:59,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:59,228 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-05 12:48:59,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:59,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:59,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:48:59,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:59,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:48:59,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:59,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:59,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:59,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:59,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:59,571 INFO L193 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 [2019-09-05 12:48:59,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:48:59,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:48:59,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:48:59,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:59,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 12:48:59,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:48:59,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 270 refuted. 2 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:49:04,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:04,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-05 12:49:04,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:04,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:49:04,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:49:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=990, Unknown=1, NotChecked=0, Total=1406 [2019-09-05 12:49:04,598 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 20 states. [2019-09-05 12:49:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:05,148 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-05 12:49:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:49:05,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-05 12:49:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:05,150 INFO L225 Difference]: With dead ends: 58 [2019-09-05 12:49:05,150 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 12:49:05,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=415, Invalid=990, Unknown=1, NotChecked=0, Total=1406 [2019-09-05 12:49:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 12:49:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-05 12:49:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 12:49:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-05 12:49:05,154 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 54 [2019-09-05 12:49:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:05,155 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-05 12:49:05,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:49:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-05 12:49:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:49:05,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:05,156 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:05,156 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-05 12:49:05,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:05,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:49:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:05,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:49:05,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:05,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:05,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:05,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:05,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:05,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:05,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:49:05,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:49:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:05,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:49:05,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:49:05,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:49:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:07,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-05 12:49:07,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:07,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:49:07,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:49:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:49:07,456 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 21 states. [2019-09-05 12:49:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:08,081 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-05 12:49:08,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:49:08,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-05 12:49:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:08,082 INFO L225 Difference]: With dead ends: 60 [2019-09-05 12:49:08,082 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 12:49:08,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:49:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 12:49:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-05 12:49:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 12:49:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-05 12:49:08,089 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 56 [2019-09-05 12:49:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:08,089 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-05 12:49:08,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:49:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-05 12:49:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 12:49:08,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:08,091 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:08,091 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-05 12:49:08,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:08,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:49:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:08,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 209 proven. 342 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 12:49:08,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:08,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:08,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:08,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:08,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:08,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:49:08,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:49:53,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 12:49:53,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:49:53,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 12:49:53,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 12:49:54,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 12:49:54,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:54,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 35 [2019-09-05 12:49:54,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:54,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:49:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:49:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=846, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:49:54,522 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 28 states. [2019-09-05 12:49:57,498 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 12:50:02,411 WARN L188 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-09-05 12:50:21,219 WARN L188 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 12:50:29,542 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 12:50:32,840 WARN L188 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 12:50:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:36,590 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-05 12:50:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:50:36,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 12:50:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:36,591 INFO L225 Difference]: With dead ends: 67 [2019-09-05 12:50:36,591 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 12:50:36,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=520, Invalid=1285, Unknown=5, NotChecked=82, Total=1892 [2019-09-05 12:50:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 12:50:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-05 12:50:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 12:50:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-09-05 12:50:36,595 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-09-05 12:50:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:36,595 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-09-05 12:50:36,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:50:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-09-05 12:50:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 12:50:36,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:36,596 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:36,596 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-05 12:50:36,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:36,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:50:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:36,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:37,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:37,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:37,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:37,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:37,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:37,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:50:37,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:50:37,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:50:37,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:50:37,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 12:50:37,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:37,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:39,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:39,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-05 12:50:39,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:39,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:50:39,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:50:39,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:50:39,495 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 23 states. [2019-09-05 12:50:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:40,331 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-09-05 12:50:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:50:40,331 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-05 12:50:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:40,332 INFO L225 Difference]: With dead ends: 65 [2019-09-05 12:50:40,332 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 12:50:40,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:50:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 12:50:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-05 12:50:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 12:50:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-09-05 12:50:40,336 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2019-09-05 12:50:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:40,336 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-09-05 12:50:40,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:50:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-09-05 12:50:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:50:40,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:40,337 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:40,337 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-05 12:50:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:40,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:50:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:40,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:41,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:41,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:41,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:41,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:41,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:41,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:50:41,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:50:41,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:41,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 12:50:41,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:41,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:43,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:43,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-05 12:50:43,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:43,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:50:43,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:50:43,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:50:43,179 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 24 states. [2019-09-05 12:50:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:44,050 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-05 12:50:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:50:44,051 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-05 12:50:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:44,052 INFO L225 Difference]: With dead ends: 67 [2019-09-05 12:50:44,052 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 12:50:44,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:50:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 12:50:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-05 12:50:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 12:50:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-09-05 12:50:44,057 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2019-09-05 12:50:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:44,057 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-09-05 12:50:44,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:50:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-09-05 12:50:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:50:44,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:44,058 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:44,058 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-05 12:50:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:50:44,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:44,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 462 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 12:50:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:44,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:44,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:44,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:44,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:50:44,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:50:55,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 12:50:55,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:50:56,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 12:50:56,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:50:56,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:50:56,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:56,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 40 [2019-09-05 12:50:56,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:56,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:50:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:50:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:50:56,727 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 32 states. [2019-09-05 12:51:08,056 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 12:51:22,169 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 12:51:30,142 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 12:51:41,767 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 12:51:49,970 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 12:51:54,480 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-05 12:51:59,481 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 12:51:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:51:59,986 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-05 12:51:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:51:59,987 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 12:51:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:51:59,987 INFO L225 Difference]: With dead ends: 75 [2019-09-05 12:51:59,987 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 12:51:59,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=669, Invalid=1676, Unknown=7, NotChecked=0, Total=2352 [2019-09-05 12:51:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 12:51:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-05 12:51:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 12:51:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-09-05 12:51:59,990 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 66 [2019-09-05 12:51:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:51:59,991 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-09-05 12:51:59,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:51:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-09-05 12:51:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:51:59,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:51:59,992 INFO L399 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:51:59,992 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:51:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:51:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash -204034418, now seen corresponding path program 21 times [2019-09-05 12:51:59,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:51:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:59,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:51:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:59,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:52:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:00,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:00,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:52:00,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:52:00,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:52:00,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:00,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:52:00,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:52:00,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:52:00,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:52:00,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:52:00,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 12:52:00,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:52:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:00,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:52:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:03,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:52:03,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2019-09-05 12:52:03,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:52:03,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:52:03,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:52:03,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:52:03,490 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 26 states. [2019-09-05 12:52:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:52:04,423 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-09-05 12:52:04,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:52:04,424 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-09-05 12:52:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:52:04,425 INFO L225 Difference]: With dead ends: 73 [2019-09-05 12:52:04,426 INFO L226 Difference]: Without dead ends: 73 [2019-09-05 12:52:04,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:52:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-05 12:52:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-05 12:52:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 12:52:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-09-05 12:52:04,429 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 70 [2019-09-05 12:52:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:52:04,429 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-09-05 12:52:04,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:52:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-09-05 12:52:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:52:04,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:52:04,430 INFO L399 BasicCegarLoop]: trace histogram [31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:52:04,430 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:52:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:52:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1889811765, now seen corresponding path program 22 times [2019-09-05 12:52:04,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:52:04,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:04,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:52:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:04,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:52:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:05,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:05,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:52:05,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:52:05,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:52:05,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:05,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:52:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:52:05,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:52:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:05,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 12:52:05,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:52:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:05,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:52:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:07,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:52:07,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-05 12:52:07,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:52:07,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:52:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:52:07,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:52:07,208 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 27 states. [2019-09-05 12:52:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:52:08,210 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-09-05 12:52:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:52:08,210 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-09-05 12:52:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:52:08,211 INFO L225 Difference]: With dead ends: 75 [2019-09-05 12:52:08,212 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 12:52:08,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:52:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 12:52:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-05 12:52:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 12:52:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-09-05 12:52:08,216 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 72 [2019-09-05 12:52:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:52:08,217 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-09-05 12:52:08,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:52:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-09-05 12:52:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 12:52:08,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:52:08,218 INFO L399 BasicCegarLoop]: trace histogram [32, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:52:08,218 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:52:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:52:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1575795656, now seen corresponding path program 23 times [2019-09-05 12:52:08,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:52:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:08,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:52:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:08,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:52:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 375 proven. 600 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 12:52:08,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:08,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:52:08,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:52:08,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:52:08,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:08,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:52:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:52:08,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:54:53,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-05 12:54:53,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:54:54,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:54:54,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:54:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 12:54:54,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:54:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 12:54:55,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:54:55,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 11] total 45 [2019-09-05 12:54:55,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:54:55,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:54:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:54:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1428, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:54:55,070 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 36 states. [2019-09-05 12:55:05,003 WARN L188 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 12:55:17,326 WARN L188 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 12:55:23,596 WARN L188 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 12:55:40,551 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 12:55:59,989 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 12:56:05,992 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 12:56:18,290 WARN L188 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 12:56:32,359 WARN L188 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 12:56:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:56:32,362 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-09-05 12:56:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:56:32,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 12:56:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:56:32,364 INFO L225 Difference]: With dead ends: 84 [2019-09-05 12:56:32,364 INFO L226 Difference]: Without dead ends: 84 [2019-09-05 12:56:32,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 80.0s TimeCoverageRelationStatistics Valid=872, Invalid=2201, Unknown=7, NotChecked=0, Total=3080 [2019-09-05 12:56:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-05 12:56:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2019-09-05 12:56:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 12:56:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-09-05 12:56:32,367 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 74 [2019-09-05 12:56:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:56:32,368 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-09-05 12:56:32,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:56:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-09-05 12:56:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:56:32,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:56:32,369 INFO L399 BasicCegarLoop]: trace histogram [34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:56:32,369 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:56:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:56:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1804529344, now seen corresponding path program 24 times [2019-09-05 12:56:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:56:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:56:32,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:56:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:56:32,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:56:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:56:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:32,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:56:32,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:56:32,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:56:32,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:56:32,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:56:32,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:56:32,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:56:32,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:56:32,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:56:32,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:56:32,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 12:56:32,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:56:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:33,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:56:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 648 refuted. 2 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:38,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:56:38,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-05 12:56:38,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:56:38,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 12:56:38,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 12:56:38,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2214, Unknown=1, NotChecked=0, Total=3080 [2019-09-05 12:56:38,713 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 29 states. [2019-09-05 12:56:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:56:39,924 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-09-05 12:56:39,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:56:39,924 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-09-05 12:56:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:56:39,925 INFO L225 Difference]: With dead ends: 81 [2019-09-05 12:56:39,925 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 12:56:39,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=865, Invalid=2214, Unknown=1, NotChecked=0, Total=3080 [2019-09-05 12:56:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 12:56:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-05 12:56:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 12:56:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-09-05 12:56:39,930 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 78 [2019-09-05 12:56:39,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:56:39,930 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-09-05 12:56:39,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 12:56:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-09-05 12:56:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 12:56:39,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:56:39,931 INFO L399 BasicCegarLoop]: trace histogram [35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:56:39,932 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:56:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:56:39,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2014275459, now seen corresponding path program 25 times [2019-09-05 12:56:39,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:56:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:56:39,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:56:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:56:39,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:56:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:56:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:40,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:56:40,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:56:40,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:56:40,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:56:40,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:56:40,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:56:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:56:40,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:56:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:56:40,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 12:56:40,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:56:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:40,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:56:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:44,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:56:44,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 58 [2019-09-05 12:56:44,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:56:44,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 12:56:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 12:56:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=2381, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:56:44,043 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 30 states. [2019-09-05 12:56:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:56:45,332 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-09-05 12:56:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 12:56:45,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2019-09-05 12:56:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:56:45,333 INFO L225 Difference]: With dead ends: 83 [2019-09-05 12:56:45,334 INFO L226 Difference]: Without dead ends: 83 [2019-09-05 12:56:45,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=925, Invalid=2381, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:56:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-05 12:56:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-05 12:56:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 12:56:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-09-05 12:56:45,337 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 80 [2019-09-05 12:56:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:56:45,338 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-09-05 12:56:45,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 12:56:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-09-05 12:56:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 12:56:45,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:56:45,338 INFO L399 BasicCegarLoop]: trace histogram [36, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:56:45,339 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:56:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:56:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1716829062, now seen corresponding path program 26 times [2019-09-05 12:56:45,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:56:45,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:56:45,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:56:45,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:56:45,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:56:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:56:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 476 proven. 756 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 12:56:46,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:56:46,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:56:46,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:56:46,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:56:46,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:56:46,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:56:46,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:56:46,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:59:44,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 12:59:44,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:46,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:59:46,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 79 refuted. 2 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-05 12:59:54,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 78 refuted. 3 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-05 13:00:03,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:03,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 13] total 51 [2019-09-05 13:00:03,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:03,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:00:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:00:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=1861, Unknown=4, NotChecked=0, Total=2550 [2019-09-05 13:00:03,502 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 40 states. [2019-09-05 13:00:15,603 WARN L188 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:00:34,046 WARN L188 SmtUtils]: Spent 5.91 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:00:39,513 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:00:54,070 WARN L188 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-05 13:00:56,834 WARN L838 $PredicateComparison]: unable to prove that (and (<= 65520 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65520) (<= 65520 (mod (+ c_main_~x~0 4294967290) 4294967296)) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520) (<= 65520 (mod (+ c_main_~x~0 4294967292) 4294967296)) (< (mod (+ c_main_~x~0 4294967277) 4294967296) 65520)) is different from false [2019-09-05 13:01:12,648 WARN L188 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:01:33,868 WARN L188 SmtUtils]: Spent 6.76 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:01:46,198 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 32 DAG size of output: 12