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/bitvector/jain_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:38:28,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:38:28,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:38:28,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:38:28,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:38:28,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:38:28,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:38:28,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:38:28,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:38:28,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:38:28,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:38:28,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:38:28,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:38:28,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:38:28,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:38:28,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:38:28,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:38:28,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:38:28,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:38:28,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:38:28,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:38:28,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:38:28,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:38:28,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:38:28,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:38:28,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:38:28,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:38:28,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:38:28,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:38:28,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:38:28,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:38:28,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:38:28,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:38:28,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:38:28,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:38:28,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:38:28,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:38:28,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:38:28,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:38:28,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:38:28,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:38:28,439 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-09 05:38:28,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:38:28,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:38:28,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:38:28,473 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:38:28,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:38:28,474 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:38:28,474 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:38:28,474 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:38:28,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:38:28,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:38:28,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:38:28,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:38:28,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:38:28,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:38:28,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:38:28,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:38:28,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:38:28,479 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:38:28,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:38:28,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:38:28,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:38:28,481 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:38:28,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:38:28,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:38:28,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:38:28,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:38:28,482 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:38:28,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:38:28,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:38:28,483 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:38:28,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:38:28,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:38:28,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:38:28,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:38:28,547 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:38:28,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/jain_5-2.c [2019-09-09 05:38:28,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6bf027b/048ef55d0d7e4a77a49dc0b5f65f6e98/FLAGdb2d45612 [2019-09-09 05:38:29,050 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:38:29,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/jain_5-2.c [2019-09-09 05:38:29,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6bf027b/048ef55d0d7e4a77a49dc0b5f65f6e98/FLAGdb2d45612 [2019-09-09 05:38:29,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6bf027b/048ef55d0d7e4a77a49dc0b5f65f6e98 [2019-09-09 05:38:29,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:38:29,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:38:29,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:38:29,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:38:29,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:38:29,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4db4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29, skipping insertion in model container [2019-09-09 05:38:29,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:38:29,503 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:38:29,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:38:29,667 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:38:29,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:38:29,694 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:38:29,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29 WrapperNode [2019-09-09 05:38:29,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:38:29,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:38:29,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:38:29,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:38:29,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (1/1) ... [2019-09-09 05:38:29,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:38:29,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:38:29,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:38:29,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:38:29,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (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-09 05:38:29,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:38:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:38:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:38:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:38:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:38:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:38:30,010 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:38:30,011 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:38:30,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:38:30 BoogieIcfgContainer [2019-09-09 05:38:30,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:38:30,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:38:30,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:38:30,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:38:30,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:38:29" (1/3) ... [2019-09-09 05:38:30,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3236c85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:38:30, skipping insertion in model container [2019-09-09 05:38:30,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:38:29" (2/3) ... [2019-09-09 05:38:30,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3236c85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:38:30, skipping insertion in model container [2019-09-09 05:38:30,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:38:30" (3/3) ... [2019-09-09 05:38:30,020 INFO L109 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2019-09-09 05:38:30,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:38:30,036 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:38:30,053 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:38:30,081 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:38:30,082 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:38:30,082 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:38:30,082 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:38:30,082 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:38:30,082 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:38:30,083 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:38:30,083 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:38:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-09 05:38:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-09 05:38:30,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:30,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:30,109 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -13144129, now seen corresponding path program 1 times [2019-09-09 05:38:30,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:30,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:30,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:30,409 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-09 05:38:30,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:38:30,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:38:30,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:38:30,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:38:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:38:30,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:38:30,443 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 6 states. [2019-09-09 05:38:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:30,596 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-09 05:38:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:38:30,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-09-09 05:38:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:30,610 INFO L225 Difference]: With dead ends: 20 [2019-09-09 05:38:30,611 INFO L226 Difference]: Without dead ends: 20 [2019-09-09 05:38:30,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:38:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-09 05:38:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-09 05:38:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-09 05:38:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-09 05:38:30,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 10 [2019-09-09 05:38:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:30,651 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-09 05:38:30,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:38:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-09 05:38:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-09 05:38:30,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:30,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:30,653 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash 327764987, now seen corresponding path program 1 times [2019-09-09 05:38:30,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:30,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:38:30,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:30,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:30,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-09 05:38:30,826 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [20], [23], [25], [28], [30], [31], [32], [33], [35], [36] [2019-09-09 05:38:30,863 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:38:30,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:38:30,934 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:38:31,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:38:31,130 INFO L272 AbstractInterpreter]: Visited 13 different actions 69 times. Merged at 2 different actions 14 times. Widened at 1 different actions 3 times. Performed 96 root evaluator evaluations with a maximum evaluation depth of 8. Performed 96 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-09 05:38:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:31,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:38:31,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:31,137 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-09 05:38:31,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:31,159 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-09 05:38:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:31,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-09 05:38:31,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:38:31,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:31,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:38:31,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:31,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 18 [2019-09-09 05:38:31,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:31,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:38:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:38:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:38:31,593 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 13 states. [2019-09-09 05:38:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:31,810 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-09 05:38:31,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:38:31,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-09-09 05:38:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:31,812 INFO L225 Difference]: With dead ends: 26 [2019-09-09 05:38:31,812 INFO L226 Difference]: Without dead ends: 26 [2019-09-09 05:38:31,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:38:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-09 05:38:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-09 05:38:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-09 05:38:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-09 05:38:31,825 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 16 [2019-09-09 05:38:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:31,826 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-09 05:38:31,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:38:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-09 05:38:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:38:31,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:31,830 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:31,831 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash 670829367, now seen corresponding path program 2 times [2019-09-09 05:38:31,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:31,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:31,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 05:38:32,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:32,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:32,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:32,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:32,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:32,021 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-09 05:38:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:38:32,036 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-09 05:38:32,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-09 05:38:32,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:38:32,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-09 05:38:32,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 05:38:32,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:38:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:32,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2019-09-09 05:38:32,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:32,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 05:38:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 05:38:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-09-09 05:38:32,443 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-09-09 05:38:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:32,609 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-09 05:38:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:38:32,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-09-09 05:38:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:32,611 INFO L225 Difference]: With dead ends: 32 [2019-09-09 05:38:32,611 INFO L226 Difference]: Without dead ends: 32 [2019-09-09 05:38:32,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-09-09 05:38:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-09 05:38:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-09 05:38:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-09 05:38:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-09 05:38:32,618 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 22 [2019-09-09 05:38:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:32,618 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-09 05:38:32,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 05:38:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-09 05:38:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:38:32,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:32,620 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:32,620 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash -887526029, now seen corresponding path program 3 times [2019-09-09 05:38:32,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:32,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:38:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:32,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:38:32,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:32,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:32,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:32,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:32,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:32,774 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:38:32,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:38:32,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:38:32,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:38:32,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:38:32,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-09 05:38:32,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 05:38:32,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:33,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:35,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-09 05:38:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2019-09-09 05:38:35,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:35,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-09 05:38:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-09 05:38:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=462, Unknown=1, NotChecked=0, Total=552 [2019-09-09 05:38:35,357 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-09-09 05:38:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:35,568 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-09 05:38:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:38:35,568 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-09-09 05:38:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:35,569 INFO L225 Difference]: With dead ends: 38 [2019-09-09 05:38:35,569 INFO L226 Difference]: Without dead ends: 38 [2019-09-09 05:38:35,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=104, Invalid=545, Unknown=1, NotChecked=0, Total=650 [2019-09-09 05:38:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-09 05:38:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-09 05:38:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-09 05:38:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-09 05:38:35,576 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 28 [2019-09-09 05:38:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:35,577 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-09 05:38:35,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-09 05:38:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-09 05:38:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:38:35,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:35,578 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:35,579 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1830498991, now seen corresponding path program 4 times [2019-09-09 05:38:35,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:35,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:35,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:38:35,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:35,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-09 05:38:35,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:35,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:35,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:35,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:35,749 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) [2019-09-09 05:38:35,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:35,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:38:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-09 05:38:35,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 05:38:35,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 05:38:36,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:36,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 27 [2019-09-09 05:38:36,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:36,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-09 05:38:36,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-09 05:38:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-09-09 05:38:36,880 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2019-09-09 05:38:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:37,596 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-09 05:38:37,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-09 05:38:37,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-09-09 05:38:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:37,599 INFO L225 Difference]: With dead ends: 44 [2019-09-09 05:38:37,599 INFO L226 Difference]: Without dead ends: 44 [2019-09-09 05:38:37,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2019-09-09 05:38:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-09 05:38:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-09 05:38:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-09 05:38:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-09 05:38:37,606 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2019-09-09 05:38:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:37,606 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-09 05:38:37,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-09 05:38:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-09 05:38:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:38:37,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:37,608 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:37,608 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:37,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1542134507, now seen corresponding path program 5 times [2019-09-09 05:38:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:37,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:37,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:37,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:37,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-09 05:38:37,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:37,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:37,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:37,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:37,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:37,792 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-09 05:38:37,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:38:37,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:38:38,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-09 05:38:38,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:38:38,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-09 05:38:38,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-09 05:38:38,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:38,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:38,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-09 05:38:39,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:39,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2019-09-09 05:38:39,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:39,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-09 05:38:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-09 05:38:39,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2019-09-09 05:38:39,185 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 21 states. [2019-09-09 05:38:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:39,558 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-09 05:38:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 05:38:39,558 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-09 05:38:39,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:39,559 INFO L225 Difference]: With dead ends: 50 [2019-09-09 05:38:39,559 INFO L226 Difference]: Without dead ends: 50 [2019-09-09 05:38:39,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2019-09-09 05:38:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-09 05:38:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-09 05:38:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-09 05:38:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-09 05:38:39,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2019-09-09 05:38:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:39,567 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-09 05:38:39,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-09 05:38:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-09 05:38:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:38:39,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:39,569 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:39,569 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1088231897, now seen corresponding path program 6 times [2019-09-09 05:38:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:39,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:38:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:39,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-09 05:38:39,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:39,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:39,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:39,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:39,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:39,790 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) [2019-09-09 05:38:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:38:39,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:38:39,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:38:39,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:38:39,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-09 05:38:39,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-09 05:38:40,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:42,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:42,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:42,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-09 05:38:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2019-09-09 05:38:42,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:42,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-09 05:38:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-09 05:38:42,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=896, Unknown=1, NotChecked=0, Total=1056 [2019-09-09 05:38:42,612 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 23 states. [2019-09-09 05:38:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:42,954 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-09 05:38:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:38:42,955 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-09-09 05:38:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:42,957 INFO L225 Difference]: With dead ends: 56 [2019-09-09 05:38:42,957 INFO L226 Difference]: Without dead ends: 56 [2019-09-09 05:38:42,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=174, Invalid=1015, Unknown=1, NotChecked=0, Total=1190 [2019-09-09 05:38:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-09 05:38:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-09 05:38:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-09 05:38:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-09 05:38:42,966 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 46 [2019-09-09 05:38:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:42,966 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-09 05:38:42,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-09 05:38:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-09 05:38:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:38:42,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:42,968 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:42,968 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1811131293, now seen corresponding path program 7 times [2019-09-09 05:38:42,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:42,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:38:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:42,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 14 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-09 05:38:43,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:43,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:43,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:43,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:43,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:43,182 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:38:43,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:43,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:38:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:43,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-09 05:38:43,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:38:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-09 05:38:43,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:38:43,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:43,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:38:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-09 05:38:46,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:38:46,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2019-09-09 05:38:46,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:38:46,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-09 05:38:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-09 05:38:46,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1071, Unknown=1, NotChecked=0, Total=1260 [2019-09-09 05:38:46,469 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-09 05:38:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:38:48,930 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-09 05:38:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:38:48,931 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-09 05:38:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:38:48,932 INFO L225 Difference]: With dead ends: 62 [2019-09-09 05:38:48,932 INFO L226 Difference]: Without dead ends: 62 [2019-09-09 05:38:48,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=203, Invalid=1201, Unknown=2, NotChecked=0, Total=1406 [2019-09-09 05:38:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-09 05:38:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-09 05:38:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-09 05:38:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-09 05:38:48,940 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 52 [2019-09-09 05:38:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:38:48,940 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-09 05:38:48,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-09 05:38:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-09 05:38:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:38:48,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:38:48,942 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:38:48,942 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:38:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:38:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1449056865, now seen corresponding path program 8 times [2019-09-09 05:38:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:38:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:48,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:38:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:38:48,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:38:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:38:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-09 05:38:49,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:49,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:38:49,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:38:49,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:38:49,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:38:49,166 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:38:49,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:38:49,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:39:13,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-09 05:39:13,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:39:13,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-09 05:39:13,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:39:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 15 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-09 05:39:14,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:39:14,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 15 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:39:15,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:39:15,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 39 [2019-09-09 05:39:15,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:39:15,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-09 05:39:15,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-09 05:39:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2019-09-09 05:39:15,729 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 27 states. [2019-09-09 05:39:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:39:16,172 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-09-09 05:39:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-09 05:39:16,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-09 05:39:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:39:16,175 INFO L225 Difference]: With dead ends: 68 [2019-09-09 05:39:16,175 INFO L226 Difference]: Without dead ends: 68 [2019-09-09 05:39:16,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2019-09-09 05:39:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-09 05:39:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-09 05:39:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-09 05:39:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-09 05:39:16,183 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 58 [2019-09-09 05:39:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:39:16,183 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-09 05:39:16,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-09 05:39:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-09 05:39:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:39:16,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:39:16,185 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:39:16,185 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:39:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:39:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1668605477, now seen corresponding path program 9 times [2019-09-09 05:39:16,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:39:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:16,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:39:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:16,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:39:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:39:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-09 05:39:16,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:16,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:39:16,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:39:16,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:39:16,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:16,455 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-09 05:39:16,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:39:16,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:39:16,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:39:16,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:39:16,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-09 05:39:16,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:39:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 17 proven. 115 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-09 05:39:16,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:39:19,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 17 proven. 112 refuted. 3 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-09 05:39:27,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:39:27,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 42 [2019-09-09 05:39:27,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:39:27,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-09 05:39:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-09 05:39:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1465, Unknown=4, NotChecked=0, Total=1722 [2019-09-09 05:39:27,415 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 29 states. [2019-09-09 05:39:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:39:27,892 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-09-09 05:39:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-09 05:39:27,892 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-09-09 05:39:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:39:27,894 INFO L225 Difference]: With dead ends: 74 [2019-09-09 05:39:27,894 INFO L226 Difference]: Without dead ends: 74 [2019-09-09 05:39:27,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=268, Invalid=1620, Unknown=4, NotChecked=0, Total=1892 [2019-09-09 05:39:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-09 05:39:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-09 05:39:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-09 05:39:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-09 05:39:27,902 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 64 [2019-09-09 05:39:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:39:27,902 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-09 05:39:27,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-09 05:39:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-09 05:39:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-09 05:39:27,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:39:27,904 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:39:27,904 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:39:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:39:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -752619241, now seen corresponding path program 10 times [2019-09-09 05:39:27,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:39:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:27,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:39:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:27,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:39:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:39:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 20 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-09 05:39:28,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:28,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:39:28,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:39:28,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:39:28,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:28,162 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-09 05:39:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:39:28,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:39:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:39:28,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-09 05:39:28,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:39:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 19 proven. 138 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-09 05:39:28,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:39:28,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:30,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 19 proven. 138 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-09 05:39:31,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:39:31,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 45 [2019-09-09 05:39:31,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:39:31,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-09 05:39:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-09 05:39:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2019-09-09 05:39:31,509 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 31 states. [2019-09-09 05:39:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:39:32,005 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-09-09 05:39:32,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-09 05:39:32,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 70 [2019-09-09 05:39:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:39:32,007 INFO L225 Difference]: With dead ends: 80 [2019-09-09 05:39:32,007 INFO L226 Difference]: Without dead ends: 80 [2019-09-09 05:39:32,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2019-09-09 05:39:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-09 05:39:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-09 05:39:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-09 05:39:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-09 05:39:32,015 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 70 [2019-09-09 05:39:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:39:32,015 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-09 05:39:32,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-09 05:39:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-09 05:39:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:39:32,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:39:32,017 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:39:32,017 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:39:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:39:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2037738323, now seen corresponding path program 11 times [2019-09-09 05:39:32,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:39:32,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:32,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:39:32,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:32,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:39:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:39:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-09 05:39:32,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:32,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:39:32,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:39:32,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:39:32,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:32,296 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-09 05:39:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:39:32,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:40:33,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-09 05:40:33,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:40:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-09 05:40:33,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:40:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 21 proven. 163 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-09 05:40:34,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:40:38,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:40:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:40:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 21 proven. 159 refuted. 4 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-09 05:40:50,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:40:50,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 48 [2019-09-09 05:40:50,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:40:50,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-09 05:40:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-09 05:40:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1922, Unknown=7, NotChecked=0, Total=2256 [2019-09-09 05:40:50,899 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 33 states. [2019-09-09 05:40:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:40:51,557 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-09-09 05:40:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-09 05:40:51,557 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2019-09-09 05:40:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:40:51,558 INFO L225 Difference]: With dead ends: 86 [2019-09-09 05:40:51,558 INFO L226 Difference]: Without dead ends: 86 [2019-09-09 05:40:51,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=342, Invalid=2101, Unknown=7, NotChecked=0, Total=2450 [2019-09-09 05:40:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-09 05:40:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-09 05:40:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-09 05:40:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-09 05:40:51,567 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 76 [2019-09-09 05:40:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:40:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-09 05:40:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-09 05:40:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-09 05:40:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:40:51,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:40:51,569 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:40:51,569 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:40:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:40:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2100906127, now seen corresponding path program 12 times [2019-09-09 05:40:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:40:51,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:40:51,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:40:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:40:51,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:40:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:40:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 24 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-09 05:40:51,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:40:51,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:40:51,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:40:51,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:40:51,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:40:51,907 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-09 05:40:51,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:40:51,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:40:51,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:40:51,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:40:51,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-09 05:40:51,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:40:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 23 proven. 190 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-09 05:40:52,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:40:53,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:40:55,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:40:55,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:40:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 23 proven. 188 refuted. 2 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-09 05:40:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:40:59,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 51 [2019-09-09 05:40:59,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:40:59,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-09 05:40:59,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-09 05:40:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2179, Unknown=2, NotChecked=0, Total=2550 [2019-09-09 05:40:59,114 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 35 states. [2019-09-09 05:40:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:40:59,975 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-09-09 05:40:59,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-09 05:40:59,975 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2019-09-09 05:40:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:40:59,976 INFO L225 Difference]: With dead ends: 92 [2019-09-09 05:40:59,977 INFO L226 Difference]: Without dead ends: 92 [2019-09-09 05:40:59,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=384, Invalid=2370, Unknown=2, NotChecked=0, Total=2756 [2019-09-09 05:40:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-09 05:40:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-09 05:40:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-09 05:40:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-09 05:40:59,992 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 82 [2019-09-09 05:40:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:40:59,993 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-09 05:40:59,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-09 05:40:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-09 05:40:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:40:59,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:41:00,001 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:41:00,002 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:41:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:41:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1982248757, now seen corresponding path program 13 times [2019-09-09 05:41:00,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:41:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:41:00,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:41:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:41:00,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:41:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:41:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 26 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-09 05:41:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:41:00,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:41:00,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:41:00,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:41:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:41:00,402 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-09 05:41:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:41:00,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:41:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:41:00,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-09 05:41:00,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:41:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 219 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-09 05:41:00,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:41:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:41:07,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:41:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 215 refuted. 4 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-09 05:41:12,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:41:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 54 [2019-09-09 05:41:12,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:41:12,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-09 05:41:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-09 05:41:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2445, Unknown=5, NotChecked=0, Total=2862 [2019-09-09 05:41:12,815 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 37 states. [2019-09-09 05:41:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:41:13,695 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-09-09 05:41:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-09 05:41:13,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2019-09-09 05:41:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:41:13,696 INFO L225 Difference]: With dead ends: 98 [2019-09-09 05:41:13,696 INFO L226 Difference]: Without dead ends: 98 [2019-09-09 05:41:13,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=427, Invalid=2648, Unknown=5, NotChecked=0, Total=3080 [2019-09-09 05:41:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-09 05:41:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-09 05:41:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-09 05:41:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-09 05:41:13,703 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 88 [2019-09-09 05:41:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:41:13,704 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-09 05:41:13,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-09 05:41:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-09 05:41:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:41:13,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:41:13,705 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:41:13,706 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:41:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:41:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash 74394631, now seen corresponding path program 14 times [2019-09-09 05:41:13,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:41:13,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:41:13,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:41:13,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:41:13,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:41:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:41:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 28 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-09 05:41:14,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:41:14,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:41:14,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:41:14,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:41:14,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:41:14,121 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-09 05:41:14,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:41:14,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:42:51,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-09 05:42:51,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:42:52,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-09 05:42:52,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:42:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 27 proven. 250 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-09 05:42:52,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:42:57,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:09,724 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-09-09 05:43:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 27 proven. 246 refuted. 4 times theorem prover too weak. 325 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:43:09,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:43:09,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 57 [2019-09-09 05:43:09,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:43:09,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-09 05:43:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-09 05:43:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=2729, Unknown=6, NotChecked=0, Total=3192 [2019-09-09 05:43:09,758 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 39 states. [2019-09-09 05:43:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:43:10,537 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-09-09 05:43:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-09 05:43:10,538 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 94 [2019-09-09 05:43:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:43:10,540 INFO L225 Difference]: With dead ends: 104 [2019-09-09 05:43:10,540 INFO L226 Difference]: Without dead ends: 104 [2019-09-09 05:43:10,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=472, Invalid=2944, Unknown=6, NotChecked=0, Total=3422 [2019-09-09 05:43:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-09 05:43:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-09 05:43:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-09 05:43:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-09 05:43:10,547 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 94 [2019-09-09 05:43:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:43:10,548 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-09 05:43:10,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-09 05:43:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-09 05:43:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:43:10,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:43:10,549 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:43:10,550 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:43:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:43:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 130331203, now seen corresponding path program 15 times [2019-09-09 05:43:10,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:43:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:43:10,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:43:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:43:10,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:43:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:43:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 30 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-09 05:43:10,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:43:10,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:43:10,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:43:10,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:43:10,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:43:10,930 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:43:10,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:43:10,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:43:10,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:43:10,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:43:10,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-09 05:43:10,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:43:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 29 proven. 283 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-09 05:43:11,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:43:18,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:21,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 29 proven. 280 refuted. 3 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-09 05:43:26,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:43:26,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 60 [2019-09-09 05:43:26,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:43:26,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-09 05:43:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-09 05:43:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=3029, Unknown=5, NotChecked=0, Total=3540 [2019-09-09 05:43:26,076 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 41 states. [2019-09-09 05:43:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:43:27,271 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-09-09 05:43:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-09 05:43:27,272 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 100 [2019-09-09 05:43:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:43:27,274 INFO L225 Difference]: With dead ends: 110 [2019-09-09 05:43:27,274 INFO L226 Difference]: Without dead ends: 110 [2019-09-09 05:43:27,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=521, Invalid=3256, Unknown=5, NotChecked=0, Total=3782 [2019-09-09 05:43:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-09 05:43:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-09 05:43:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-09 05:43:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-09 05:43:27,284 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 100 [2019-09-09 05:43:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:43:27,286 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-09 05:43:27,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-09 05:43:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-09 05:43:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:43:27,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:43:27,288 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:43:27,288 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:43:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:43:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1616092031, now seen corresponding path program 16 times [2019-09-09 05:43:27,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:43:27,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:43:27,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:43:27,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:43:27,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:43:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:43:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 32 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-09 05:43:27,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:43:27,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:43:27,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:43:27,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:43:27,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:43:27,764 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-09 05:43:27,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:43:27,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:43:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:43:27,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-09 05:43:27,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:43:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 31 proven. 318 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-09 05:43:28,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:43:37,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:40,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:40,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:43:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 31 proven. 316 refuted. 2 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-09 05:43:46,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:43:46,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 24] total 63 [2019-09-09 05:43:46,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:43:46,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-09 05:43:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-09 05:43:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=558, Invalid=3341, Unknown=7, NotChecked=0, Total=3906 [2019-09-09 05:43:46,860 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 43 states. [2019-09-09 05:43:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:43:48,293 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-09-09 05:43:48,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-09 05:43:48,294 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 106 [2019-09-09 05:43:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:43:48,295 INFO L225 Difference]: With dead ends: 116 [2019-09-09 05:43:48,295 INFO L226 Difference]: Without dead ends: 116 [2019-09-09 05:43:48,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=573, Invalid=3580, Unknown=7, NotChecked=0, Total=4160 [2019-09-09 05:43:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-09 05:43:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-09 05:43:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-09 05:43:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-09 05:43:48,302 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 106 [2019-09-09 05:43:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:43:48,302 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-09 05:43:48,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-09 05:43:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-09 05:43:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:43:48,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:43:48,304 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:43:48,304 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:43:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:43:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2008700997, now seen corresponding path program 17 times [2019-09-09 05:43:48,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:43:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:43:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:43:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:43:48,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:43:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:43:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 34 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-09 05:43:48,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:43:48,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:43:48,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:43:48,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:43:48,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:43:48,751 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-09 05:43:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:43:48,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:46:07,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-09 05:46:07,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:46:08,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-09 05:46:08,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:46:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 33 proven. 355 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-09 05:46:08,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:46:13,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:46:19,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:46:19,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:46:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 33 proven. 350 refuted. 5 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-09 05:46:30,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:46:30,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 66 [2019-09-09 05:46:30,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:46:30,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-09 05:46:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-09 05:46:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=3673, Unknown=6, NotChecked=0, Total=4290 [2019-09-09 05:46:30,156 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 45 states. [2019-09-09 05:46:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:31,358 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-09-09 05:46:31,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-09 05:46:31,358 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 112 [2019-09-09 05:46:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:31,360 INFO L225 Difference]: With dead ends: 122 [2019-09-09 05:46:31,360 INFO L226 Difference]: Without dead ends: 122 [2019-09-09 05:46:31,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=626, Invalid=3924, Unknown=6, NotChecked=0, Total=4556 [2019-09-09 05:46:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-09 05:46:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-09 05:46:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-09 05:46:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-09 05:46:31,371 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 112 [2019-09-09 05:46:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:31,375 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-09 05:46:31,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-09 05:46:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-09 05:46:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:46:31,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:31,378 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:31,378 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:31,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1552640265, now seen corresponding path program 18 times [2019-09-09 05:46:31,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:46:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 36 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-09 05:46:31,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:31,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:46:31,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:46:31,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:46:31,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:31,889 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-09 05:46:31,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:46:31,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:46:31,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:46:31,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:46:31,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-09 05:46:31,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:46:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 35 proven. 394 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-09 05:46:32,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:46:41,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:46:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:46:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:46:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 35 proven. 388 refuted. 6 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-09 05:46:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:46:57,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 69 [2019-09-09 05:46:57,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:46:57,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-09 05:46:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-09 05:46:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=4016, Unknown=10, NotChecked=0, Total=4692 [2019-09-09 05:46:57,229 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 47 states. [2019-09-09 05:46:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:58,853 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-09-09 05:46:58,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-09 05:46:58,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 118 [2019-09-09 05:46:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:58,855 INFO L225 Difference]: With dead ends: 128 [2019-09-09 05:46:58,855 INFO L226 Difference]: Without dead ends: 128 [2019-09-09 05:46:58,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=681, Invalid=4279, Unknown=10, NotChecked=0, Total=4970 [2019-09-09 05:46:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-09 05:46:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-09 05:46:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-09 05:46:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-09 05:46:58,861 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 118 [2019-09-09 05:46:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:58,861 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-09 05:46:58,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-09 05:46:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-09 05:46:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:46:58,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:58,863 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:58,863 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2070554931, now seen corresponding path program 19 times [2019-09-09 05:46:58,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:58,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:46:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:58,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 38 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-09 05:46:59,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:59,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:46:59,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:46:59,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:46:59,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:59,475 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) [2019-09-09 05:46:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:59,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:46:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:59,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-09 05:46:59,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 37 proven. 435 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-09 05:47:00,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:11,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:47:19,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:47:19,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:47:33,026 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 15 [2019-09-09 05:47:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 37 proven. 428 refuted. 7 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-09 05:47:33,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:47:33,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 27] total 72 [2019-09-09 05:47:33,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:47:33,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-09 05:47:33,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-09 05:47:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=4374, Unknown=13, NotChecked=0, Total=5112 [2019-09-09 05:47:33,060 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 49 states. [2019-09-09 05:47:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:34,615 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-09-09 05:47:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-09 05:47:34,615 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 124 [2019-09-09 05:47:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:34,616 INFO L225 Difference]: With dead ends: 134 [2019-09-09 05:47:34,616 INFO L226 Difference]: Without dead ends: 134 [2019-09-09 05:47:34,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=740, Invalid=4649, Unknown=13, NotChecked=0, Total=5402 [2019-09-09 05:47:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-09 05:47:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-09 05:47:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-09 05:47:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-09 05:47:34,623 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 124 [2019-09-09 05:47:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:34,623 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-09 05:47:34,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-09 05:47:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-09 05:47:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:47:34,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:34,625 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:34,625 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2069896815, now seen corresponding path program 20 times [2019-09-09 05:47:34,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:34,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-09 05:47:35,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:35,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:35,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:47:35,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:47:35,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:35,294 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-09 05:47:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:47:35,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:50:31,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-09 05:50:31,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:50:31,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-09 05:50:31,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:50:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 39 proven. 478 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-09 05:50:32,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:50:50,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:51:00,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:51:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 39 proven. 472 refuted. 6 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-09 05:51:11,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:51:11,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 28] total 75 [2019-09-09 05:51:11,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:51:11,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-09 05:51:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-09 05:51:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=4748, Unknown=15, NotChecked=0, Total=5550 [2019-09-09 05:51:11,920 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 51 states. [2019-09-09 05:51:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:13,432 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-09-09 05:51:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-09 05:51:13,433 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 130 [2019-09-09 05:51:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:13,434 INFO L225 Difference]: With dead ends: 140 [2019-09-09 05:51:13,434 INFO L226 Difference]: Without dead ends: 140 [2019-09-09 05:51:13,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=802, Invalid=5035, Unknown=15, NotChecked=0, Total=5852 [2019-09-09 05:51:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-09 05:51:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-09 05:51:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-09 05:51:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-09 05:51:13,441 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 130 [2019-09-09 05:51:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:13,441 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-09 05:51:13,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-09 05:51:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-09 05:51:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-09 05:51:13,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:51:13,443 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:51:13,443 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:51:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:51:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1405077845, now seen corresponding path program 21 times [2019-09-09 05:51:13,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:51:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:13,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:51:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:13,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:51:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:51:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 42 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-09 05:51:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:51:14,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:51:14,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:51:14,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:51:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:51:14,053 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:51:14,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:51:14,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:51:14,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:51:14,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:51:14,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-09 05:51:14,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:51:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 41 proven. 523 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-09 05:51:15,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:51:35,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:51:48,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:51:48,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:52:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 41 proven. 513 refuted. 10 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-09 05:52:04,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:52:04,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29, 29] total 78 [2019-09-09 05:52:04,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:52:04,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-09 05:52:04,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-09 05:52:04,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=5136, Unknown=20, NotChecked=0, Total=6006 [2019-09-09 05:52:04,559 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 53 states. [2019-09-09 05:52:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:08,148 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-09-09 05:52:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-09 05:52:08,152 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 136 [2019-09-09 05:52:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:08,153 INFO L225 Difference]: With dead ends: 146 [2019-09-09 05:52:08,153 INFO L226 Difference]: Without dead ends: 146 [2019-09-09 05:52:08,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=865, Invalid=5434, Unknown=21, NotChecked=0, Total=6320 [2019-09-09 05:52:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-09 05:52:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-09 05:52:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-09 05:52:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-09 05:52:08,160 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 136 [2019-09-09 05:52:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:08,161 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-09 05:52:08,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-09 05:52:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-09 05:52:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:52:08,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:08,162 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:08,162 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1331416601, now seen corresponding path program 22 times [2019-09-09 05:52:08,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:08,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:08,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:52:08,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:08,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 44 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-09 05:52:08,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:52:08,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:52:08,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:52:08,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:52:08,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:52:08,759 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-09 05:52:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:08,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:52:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:08,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-09 05:52:08,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:52:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 43 proven. 570 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-09 05:52:09,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:52:22,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:52:28,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:52:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 43 proven. 564 refuted. 6 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-09 05:52:42,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:52:42,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 30] total 81 [2019-09-09 05:52:42,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:52:42,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-09 05:52:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-09 05:52:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=915, Invalid=5552, Unknown=13, NotChecked=0, Total=6480 [2019-09-09 05:52:42,752 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 55 states. [2019-09-09 05:52:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:45,793 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-09-09 05:52:45,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-09 05:52:45,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 142 [2019-09-09 05:52:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:45,798 INFO L225 Difference]: With dead ends: 152 [2019-09-09 05:52:45,799 INFO L226 Difference]: Without dead ends: 152 [2019-09-09 05:52:45,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=930, Invalid=5863, Unknown=13, NotChecked=0, Total=6806 [2019-09-09 05:52:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-09 05:52:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-09 05:52:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-09 05:52:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-09 05:52:45,805 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 142 [2019-09-09 05:52:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:45,805 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-09 05:52:45,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-09 05:52:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-09 05:52:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-09 05:52:45,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:45,807 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:45,807 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1059729373, now seen corresponding path program 23 times [2019-09-09 05:52:45,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:45,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:45,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 46 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-09 05:52:46,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:52:46,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:52:46,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:52:46,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:52:46,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:52:46,450 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-09 05:52:46,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:52:46,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)