java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:46:27,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:46:27,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:46:27,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:46:27,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:46:27,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:46:27,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:46:27,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:46:27,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:46:27,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:46:27,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:46:27,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:46:27,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:46:27,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:46:27,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:46:27,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:46:27,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:46:27,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:46:27,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:46:27,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:46:27,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:46:27,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:46:27,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:46:27,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:46:27,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:46:27,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:46:27,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:46:27,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:46:27,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:46:27,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:46:27,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:46:27,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:46:27,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:46:27,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:46:27,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:46:27,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:46:27,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:46:27,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:46:27,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:46:27,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:46:27,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:46:27,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 12:46:27,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:46:27,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:46:27,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:46:27,505 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:46:27,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:46:27,506 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:46:27,506 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:46:27,506 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:46:27,507 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:46:27,507 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:46:27,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:46:27,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:46:27,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:46:27,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:46:27,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:46:27,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:46:27,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:46:27,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:46:27,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:46:27,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:46:27,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:46:27,512 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:46:27,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:46:27,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:27,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:46:27,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:46:27,513 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:46:27,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:46:27,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:46:27,513 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:46:27,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:46:27,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:46:27,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:46:27,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:46:27,581 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:46:27,581 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-05 12:46:27,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eccbd24d/24049516532540b09243b0510fe9b8fe/FLAGc765e6fb8 [2019-09-05 12:46:28,025 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:46:28,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-05 12:46:28,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eccbd24d/24049516532540b09243b0510fe9b8fe/FLAGc765e6fb8 [2019-09-05 12:46:28,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eccbd24d/24049516532540b09243b0510fe9b8fe [2019-09-05 12:46:28,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:46:28,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:46:28,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:28,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:46:28,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:46:28,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4b40c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28, skipping insertion in model container [2019-09-05 12:46:28,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,434 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:46:28,448 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:46:28,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:28,692 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:46:28,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:28,738 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:46:28,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28 WrapperNode [2019-09-05 12:46:28,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:28,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:46:28,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:46:28,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:46:28,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... [2019-09-05 12:46:28,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:46:28,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:46:28,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:46:28,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:46:28,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:46:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:46:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:46:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:46:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:46:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:46:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:46:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:46:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:46:29,166 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:46:29,166 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 12:46:29,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:29 BoogieIcfgContainer [2019-09-05 12:46:29,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:46:29,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:46:29,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:46:29,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:46:29,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:46:28" (1/3) ... [2019-09-05 12:46:29,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b4606e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:29, skipping insertion in model container [2019-09-05 12:46:29,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:28" (2/3) ... [2019-09-05 12:46:29,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b4606e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:29, skipping insertion in model container [2019-09-05 12:46:29,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:29" (3/3) ... [2019-09-05 12:46:29,175 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-09-05 12:46:29,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:46:29,192 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:46:29,210 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:46:29,241 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:46:29,242 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:46:29,242 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:46:29,242 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:46:29,242 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:46:29,243 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:46:29,243 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:46:29,243 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:46:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-05 12:46:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:46:29,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,285 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-05 12:46:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:29,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:29,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:29,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:29,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:29,572 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-05 12:46:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:29,620 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-05 12:46:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:29,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:46:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:29,635 INFO L225 Difference]: With dead ends: 22 [2019-09-05 12:46:29,635 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 12:46:29,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 12:46:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-05 12:46:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 12:46:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 12:46:29,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 12:46:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:29,681 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 12:46:29,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 12:46:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 12:46:29,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,684 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-05 12:46:29,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:29,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:29,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:29,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:29,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:29,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:29,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:29,776 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-05 12:46:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:29,787 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-05 12:46:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:29,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-05 12:46:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:29,788 INFO L225 Difference]: With dead ends: 15 [2019-09-05 12:46:29,788 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 12:46:29,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 12:46:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 12:46:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:46:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-05 12:46:29,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-05 12:46:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:29,793 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-05 12:46:29,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-05 12:46:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:46:29,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,794 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-05 12:46:29,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:29,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-05 12:46:29,875 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [20], [22], [26], [32], [35], [37], [43], [44], [45], [47] [2019-09-05 12:46:29,911 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:29,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:29,966 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:46:30,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:46:30,295 INFO L272 AbstractInterpreter]: Visited 14 different actions 110 times. Merged at 5 different actions 44 times. Widened at 3 different actions 17 times. Performed 231 root evaluator evaluations with a maximum evaluation depth of 12. Performed 231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 14 fixpoints after 3 different actions. Largest state had 4 variables. [2019-09-05 12:46:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:30,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:46:30,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:30,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:30,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:30,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:46:30,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,402 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:46:30,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:30,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2019-09-05 12:46:30,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:30,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:46:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:46:30,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:30,457 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-05 12:46:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:30,583 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-05 12:46:30,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:46:30,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-05 12:46:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:30,585 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:46:30,585 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 12:46:30,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:46:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 12:46:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-05 12:46:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:46:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-05 12:46:30,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-05 12:46:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:30,591 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-05 12:46:30,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:46:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-05 12:46:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:46:30,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:30,592 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:30,593 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-05 12:46:30,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:30,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:30,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 12:46:30,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:30,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:30,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:30,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,693 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:30,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:30,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:30,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 12:46:30,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:30,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:46:30,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-05 12:46:30,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 12:46:30,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:30,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 13 [2019-09-05 12:46:30,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:30,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:46:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:46:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:46:30,936 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2019-09-05 12:46:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:31,176 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-05 12:46:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:46:31,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-05 12:46:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:31,178 INFO L225 Difference]: With dead ends: 34 [2019-09-05 12:46:31,178 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 12:46:31,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:46:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 12:46:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-05 12:46:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 12:46:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-05 12:46:31,183 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-05 12:46:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:31,184 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-05 12:46:31,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:46:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-05 12:46:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:46:31,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:31,185 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:31,185 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-05 12:46:31,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-05 12:46:31,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:31,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:31,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:31,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:31,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:31,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:31,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:31,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:31,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:31,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:31,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:46:31,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:46:31,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-05 12:46:31,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:31,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 17 [2019-09-05 12:46:31,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:31,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:46:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:46:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:46:31,607 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2019-09-05 12:46:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:31,999 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-05 12:46:32,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:46:32,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 12:46:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:32,003 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:46:32,003 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 12:46:32,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:46:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 12:46:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-09-05 12:46:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 12:46:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 12:46:32,010 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-09-05 12:46:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:32,010 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 12:46:32,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:46:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 12:46:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:46:32,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:32,012 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:32,012 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1027694321, now seen corresponding path program 4 times [2019-09-05 12:46:32,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:32,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:32,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-05 12:46:32,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:32,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:32,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:32,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:32,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:32,160 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-05 12:46:32,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:32,174 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-05 12:46:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:32,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:46:32,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 12:46:32,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 12:46:32,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:32,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2019-09-05 12:46:32,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:32,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:46:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:46:32,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:32,501 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-09-05 12:46:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:33,083 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-05 12:46:33,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:46:33,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-05 12:46:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:33,085 INFO L225 Difference]: With dead ends: 58 [2019-09-05 12:46:33,085 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 12:46:33,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:46:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 12:46:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-09-05 12:46:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 12:46:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-05 12:46:33,092 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 38 [2019-09-05 12:46:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:33,093 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-05 12:46:33,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:46:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-05 12:46:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:46:33,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,094 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,094 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash 79747558, now seen corresponding path program 5 times [2019-09-05 12:46:33,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-05 12:46:33,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:33,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:33,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:33,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,244 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:33,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:33,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:33,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 12:46:33,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:33,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:46:33,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 153 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-05 12:46:33,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 153 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-05 12:46:33,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 12:46:33,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:33,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:46:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:46:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:33,507 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-09-05 12:46:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:33,559 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-05 12:46:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:46:33,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-05 12:46:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:33,563 INFO L225 Difference]: With dead ends: 56 [2019-09-05 12:46:33,564 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 12:46:33,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 12:46:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-05 12:46:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 12:46:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-09-05 12:46:33,575 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-09-05 12:46:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:33,576 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-09-05 12:46:33,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:46:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-09-05 12:46:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 12:46:33,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,577 INFO L399 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,578 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1763701256, now seen corresponding path program 6 times [2019-09-05 12:46:33,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:33,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-05 12:46:33,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:33,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:33,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:33,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,737 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-05 12:46:33,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:33,751 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-05 12:46:33,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:33,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:33,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:46:33,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:46:33,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 6 proven. 530 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:46:34,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:34,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2019-09-05 12:46:34,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:34,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:46:34,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:46:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:46:34,621 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2019-09-05 12:46:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:35,844 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-05 12:46:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:46:35,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-05 12:46:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:35,852 INFO L225 Difference]: With dead ends: 80 [2019-09-05 12:46:35,852 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 12:46:35,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=880, Invalid=3812, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:46:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 12:46:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-09-05 12:46:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 12:46:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-05 12:46:35,860 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 55 [2019-09-05 12:46:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:35,861 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-05 12:46:35,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:46:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-05 12:46:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:46:35,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:35,863 INFO L399 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:35,863 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1703496983, now seen corresponding path program 7 times [2019-09-05 12:46:35,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:35,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 326 proven. 28 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-05 12:46:36,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:36,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:36,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:36,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:36,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:36,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 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-05 12:46:36,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:36,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:36,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:46:36,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-05 12:46:36,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 7 proven. 1017 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-05 12:46:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2019-09-05 12:46:36,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:36,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:46:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:46:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:46:36,810 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 24 states. [2019-09-05 12:46:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:38,354 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-09-05 12:46:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:46:38,354 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-05 12:46:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:38,355 INFO L225 Difference]: With dead ends: 98 [2019-09-05 12:46:38,355 INFO L226 Difference]: Without dead ends: 98 [2019-09-05 12:46:38,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1283, Invalid=6199, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:46:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-05 12:46:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-09-05 12:46:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 12:46:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-05 12:46:38,367 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 70 [2019-09-05 12:46:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:38,367 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-05 12:46:38,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:46:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-05 12:46:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-05 12:46:38,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:38,369 INFO L399 BasicCegarLoop]: trace histogram [56, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:38,370 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1048409624, now seen corresponding path program 8 times [2019-09-05 12:46:38,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:38,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:38,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:38,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:38,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-05 12:46:38,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:38,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:38,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:38,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:38,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:38,539 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-05 12:46:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:38,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:38,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 12:46:38,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:38,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:46:38,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 499 proven. 36 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-05 12:46:38,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 499 proven. 36 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-05 12:46:38,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:38,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-05 12:46:38,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:38,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:46:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:46:38,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:38,961 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 12 states. [2019-09-05 12:46:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:39,066 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-05 12:46:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:46:39,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-05 12:46:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:39,068 INFO L225 Difference]: With dead ends: 95 [2019-09-05 12:46:39,068 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 12:46:39,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 12:46:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-05 12:46:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 12:46:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-09-05 12:46:39,075 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 87 [2019-09-05 12:46:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:39,075 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-09-05 12:46:39,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:46:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-09-05 12:46:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 12:46:39,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:39,079 INFO L399 BasicCegarLoop]: trace histogram [63, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:39,079 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1289232840, now seen corresponding path program 9 times [2019-09-05 12:46:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 607 proven. 45 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-09-05 12:46:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:39,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:39,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:39,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:39,272 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) [2019-09-05 12:46:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:39,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:39,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:39,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:39,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 12:46:39,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-05 12:46:39,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 16 proven. 2177 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-05 12:46:40,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2019-09-05 12:46:40,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:40,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:46:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:46:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:46:40,326 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 28 states. [2019-09-05 12:46:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:43,112 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-09-05 12:46:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 12:46:43,112 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-05 12:46:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:43,113 INFO L225 Difference]: With dead ends: 127 [2019-09-05 12:46:43,114 INFO L226 Difference]: Without dead ends: 127 [2019-09-05 12:46:43,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:46:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-05 12:46:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-05 12:46:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 12:46:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-05 12:46:43,125 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 94 [2019-09-05 12:46:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:43,126 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-05 12:46:43,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:46:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-05 12:46:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 12:46:43,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:43,128 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:43,128 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 10 times [2019-09-05 12:46:43,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:43,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:43,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:43,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-05 12:46:43,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:43,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:43,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:43,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:43,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:43,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:43,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:43,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:43,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:46:43,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3506 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-05 12:46:43,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 18 proven. 3488 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-05 12:46:45,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:45,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 39 [2019-09-05 12:46:45,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:45,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:46:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:46:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:46:45,002 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 21 states. [2019-09-05 12:46:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:45,489 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-09-05 12:46:45,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:46:45,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2019-09-05 12:46:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:45,492 INFO L225 Difference]: With dead ends: 140 [2019-09-05 12:46:45,492 INFO L226 Difference]: Without dead ends: 140 [2019-09-05 12:46:45,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:46:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-05 12:46:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-09-05 12:46:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 12:46:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2019-09-05 12:46:45,503 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 114 [2019-09-05 12:46:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:45,504 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2019-09-05 12:46:45,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:46:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2019-09-05 12:46:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-05 12:46:45,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:45,506 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:45,506 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash -535987528, now seen corresponding path program 11 times [2019-09-05 12:46:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:45,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:45,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4437 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-05 12:46:45,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:45,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:45,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:45,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:45,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:45,743 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) [2019-09-05 12:46:45,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:45,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:46,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-05 12:46:46,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:46,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 12:46:46,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:46,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:46:46,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:46:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:46:46,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:46:46,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:46:59,089 WARN L188 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-05 12:47:03,766 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-05 12:47:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 3947 trivial. 0 not checked. [2019-09-05 12:47:03,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 3947 trivial. 0 not checked. [2019-09-05 12:47:08,240 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:47:08,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [12] total 22 [2019-09-05 12:47:08,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:47:08,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:47:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:47:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=358, Unknown=4, NotChecked=0, Total=462 [2019-09-05 12:47:08,242 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2019-09-05 12:47:12,578 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-05 12:47:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:12,579 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-09-05 12:47:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:47:12,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-09-05 12:47:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:12,580 INFO L225 Difference]: With dead ends: 126 [2019-09-05 12:47:12,580 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:47:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=120, Invalid=428, Unknown=4, NotChecked=0, Total=552 [2019-09-05 12:47:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:47:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:47:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:47:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:47:12,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2019-09-05 12:47:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:12,582 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:47:12,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:47:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:47:12,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:47:12,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:47:12 BoogieIcfgContainer [2019-09-05 12:47:12,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:47:12,588 INFO L168 Benchmark]: Toolchain (without parser) took 44169.60 ms. Allocated memory was 140.0 MB in the beginning and 373.8 MB in the end (delta: 233.8 MB). Free memory was 87.3 MB in the beginning and 135.0 MB in the end (delta: -47.7 MB). Peak memory consumption was 186.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:47:12,589 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 12:47:12,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.83 ms. Allocated memory is still 140.0 MB. Free memory was 86.9 MB in the beginning and 78.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-05 12:47:12,591 INFO L168 Benchmark]: Boogie Preprocessor took 157.14 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 77.8 MB in the beginning and 180.4 MB in the end (delta: -102.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:47:12,591 INFO L168 Benchmark]: RCFGBuilder took 269.47 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 168.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-09-05 12:47:12,592 INFO L168 Benchmark]: TraceAbstraction took 43418.27 ms. Allocated memory was 202.4 MB in the beginning and 373.8 MB in the end (delta: 171.4 MB). Free memory was 168.2 MB in the beginning and 135.0 MB in the end (delta: 33.1 MB). Peak memory consumption was 204.6 MB. Max. memory is 7.1 GB. [2019-09-05 12:47:12,596 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 320.83 ms. Allocated memory is still 140.0 MB. Free memory was 86.9 MB in the beginning and 78.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.14 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 77.8 MB in the beginning and 180.4 MB in the end (delta: -102.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 269.47 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 168.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43418.27 ms. Allocated memory was 202.4 MB in the beginning and 373.8 MB in the end (delta: 171.4 MB). Free memory was 168.2 MB in the beginning and 135.0 MB in the end (delta: 33.1 MB). Peak memory consumption was 204.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 43.3s OverallTime, 13 OverallIterations, 90 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 199 SDtfs, 65 SDslu, 1193 SDs, 0 SdLazy, 5190 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1691 GetRequests, 1230 SyntacticMatches, 6 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7511 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 67 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2079 ConstructedInterpolants, 2 QuantifiedInterpolants, 712330 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1389 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 35 InterpolantComputations, 4 PerfectInterpolantSequences, 24388/47509 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...