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/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:36:48,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:36:48,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:36:48,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:36:48,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:36:48,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:36:48,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:36:48,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:36:48,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:36:48,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:36:48,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:36:48,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:36:48,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:36:48,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:36:48,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:36:48,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:36:48,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:36:48,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:36:48,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:36:48,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:36:48,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:36:48,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:36:48,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:36:48,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:36:48,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:36:48,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:36:48,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:36:48,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:36:48,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:36:48,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:36:48,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:36:48,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:36:48,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:36:48,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:36:48,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:36:48,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:36:48,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:36:48,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:36:48,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:36:48,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:36:48,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:36:48,673 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-03 20:36:48,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:36:48,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:36:48,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:36:48,691 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:36:48,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:36:48,692 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:36:48,692 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:36:48,693 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:36:48,693 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:36:48,693 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:36:48,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:36:48,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:36:48,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:36:48,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:36:48,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:36:48,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:36:48,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:36:48,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:36:48,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:36:48,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:36:48,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:36:48,698 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:36:48,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:36:48,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:36:48,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:36:48,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:36:48,699 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:36:48,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:36:48,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:36:48,699 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:36:48,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:36:48,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:36:48,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:36:48,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:36:48,748 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:36:48,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2019-09-03 20:36:48,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f16d29e6/90ea02756abc4f52ba3973763cf90565/FLAG3dc244735 [2019-09-03 20:36:49,253 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:36:49,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2019-09-03 20:36:49,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f16d29e6/90ea02756abc4f52ba3973763cf90565/FLAG3dc244735 [2019-09-03 20:36:49,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f16d29e6/90ea02756abc4f52ba3973763cf90565 [2019-09-03 20:36:49,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:36:49,656 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:36:49,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:49,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:36:49,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:36:49,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:49,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648ab88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49, skipping insertion in model container [2019-09-03 20:36:49,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:49,673 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:36:49,691 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:36:49,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:49,902 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:36:49,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:49,932 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:36:49,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49 WrapperNode [2019-09-03 20:36:49,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:49,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:36:49,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:36:49,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:36:50,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (1/1) ... [2019-09-03 20:36:50,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:36:50,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:36:50,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:36:50,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:36:50,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (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-03 20:36:50,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:36:50,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:36:50,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:36:50,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:36:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:36:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:36:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:36:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:36:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:36:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:36:50,314 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:36:50,314 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:36:50,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:50 BoogieIcfgContainer [2019-09-03 20:36:50,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:36:50,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:36:50,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:36:50,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:36:50,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:36:49" (1/3) ... [2019-09-03 20:36:50,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2362f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:50, skipping insertion in model container [2019-09-03 20:36:50,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:49" (2/3) ... [2019-09-03 20:36:50,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2362f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:50, skipping insertion in model container [2019-09-03 20:36:50,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:50" (3/3) ... [2019-09-03 20:36:50,331 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2019-09-03 20:36:50,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:36:50,350 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:36:50,369 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:36:50,412 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:36:50,412 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:36:50,412 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:36:50,412 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:36:50,413 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:36:50,413 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:36:50,413 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:36:50,413 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:36:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:36:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:50,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:50,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:50,449 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-03 20:36:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:50,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:50,588 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-03 20:36:50,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:50,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:36:50,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:50,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:36:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:36:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:36:50,607 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 20:36:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:50,624 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:36:50,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:36:50,625 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:36:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:50,632 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:36:50,633 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 20:36:50,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:36:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 20:36:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 20:36:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:36:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 20:36:50,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 20:36:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:50,666 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 20:36:50,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:36:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 20:36:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:50,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:50,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:50,668 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2019-09-03 20:36:50,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:50,771 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-03 20:36:50,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:50,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:36:50,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:50,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:36:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:36:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:36:50,776 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-03 20:36:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:50,824 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-03 20:36:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:36:50,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:36:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:50,826 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:36:50,826 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:36:50,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:36:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:36:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:36:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:36:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-03 20:36:50,833 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-03 20:36:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:50,833 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-03 20:36:50,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:36:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-03 20:36:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:36:50,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:50,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:50,834 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2019-09-03 20:36:50,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:51,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:51,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:51,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-03 20:36:51,091 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:36:51,128 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:36:51,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:36:51,185 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:36:51,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:36:51,309 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 101 root evaluator evaluations with a maximum evaluation depth of 6. Performed 101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-03 20:36:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:51,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:36:51,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:51,314 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:51,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:51,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:51,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:36:51,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:51,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:51,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:51,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:51,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-09-03 20:36:51,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:51,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:36:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:36:51,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:36:51,794 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2019-09-03 20:36:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:52,057 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-09-03 20:36:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:36:52,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2019-09-03 20:36:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:52,058 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:36:52,058 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:36:52,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:36:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:36:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-03 20:36:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:36:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 20:36:52,063 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2019-09-03 20:36:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:52,064 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 20:36:52,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:36:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 20:36:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:36:52,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,065 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:52,065 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1350121109, now seen corresponding path program 1 times [2019-09-03 20:36:52,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:52,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-03 20:36:52,110 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [17], [19], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:36:52,112 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:36:52,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:36:52,114 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:36:52,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:36:52,199 INFO L272 AbstractInterpreter]: Visited 14 different actions 90 times. Merged at 5 different actions 36 times. Widened at 1 different actions 6 times. Performed 158 root evaluator evaluations with a maximum evaluation depth of 6. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 5 variables. [2019-09-03 20:36:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:36:52,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,200 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-03 20:36:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:36:52,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:52,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-03 20:36:52,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:52,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:36:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:36:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:36:52,268 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-09-03 20:36:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:52,297 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-09-03 20:36:52,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:36:52,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 20:36:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:52,299 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:36:52,299 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:36:52,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:36:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:36:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 20:36:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:36:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-03 20:36:52,305 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-03 20:36:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-03 20:36:52,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:36:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-03 20:36:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:36:52,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,308 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:52,308 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 2 times [2019-09-03 20:36:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:36:52,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:52,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:52,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:52,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:52,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:52,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:36:52,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:36:52,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:52,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:36:52,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:52,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:53,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2019-09-03 20:36:53,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:53,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:36:53,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:36:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:36:53,247 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2019-09-03 20:36:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,813 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-03 20:36:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:36:53,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2019-09-03 20:36:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,815 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:36:53,815 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:36:53,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:36:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:36:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 20:36:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:36:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-03 20:36:53,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2019-09-03 20:36:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,821 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-03 20:36:53,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:36:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-03 20:36:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:36:53,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,822 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,823 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1753373675, now seen corresponding path program 2 times [2019-09-03 20:36:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:53,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:53,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:53,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:53,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,899 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-03 20:36:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:53,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:53,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:36:53,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:53,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:36:53,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-03 20:36:54,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:36:54,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:36:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,037 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2019-09-03 20:36:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,068 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-03 20:36:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:36:54,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-03 20:36:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,069 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:36:54,069 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:36:54,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:36:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 20:36:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:36:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-03 20:36:54,074 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2019-09-03 20:36:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,075 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-03 20:36:54,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:36:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-03 20:36:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:36:54,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,076 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,076 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958777, now seen corresponding path program 3 times [2019-09-03 20:36:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:54,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:54,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:54,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:54,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:54,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2019-09-03 20:36:54,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:36:54,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:36:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,241 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-09-03 20:36:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,293 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-03 20:36:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:36:54,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-03 20:36:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,295 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:36:54,295 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:36:54,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:36:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 20:36:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:36:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-03 20:36:54,303 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2019-09-03 20:36:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,303 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-03 20:36:54,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:36:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-03 20:36:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:36:54,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,308 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,308 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash 98169237, now seen corresponding path program 4 times [2019-09-03 20:36:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:54,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:54,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:54,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2019-09-03 20:36:54,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:36:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:36:54,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,511 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2019-09-03 20:36:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,551 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-03 20:36:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:36:54,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-03 20:36:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,553 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:36:54,553 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:36:54,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:36:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-03 20:36:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:36:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-03 20:36:54,558 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2019-09-03 20:36:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,558 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-03 20:36:54,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:36:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-03 20:36:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:36:54,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,560 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,560 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 144867641, now seen corresponding path program 5 times [2019-09-03 20:36:54,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:54,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:54,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:54,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:36:54,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2019-09-03 20:36:54,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:36:54,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:36:54,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,768 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-09-03 20:36:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,819 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-03 20:36:54,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:36:54,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-09-03 20:36:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,822 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:36:54,822 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:36:54,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:36:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 20:36:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:36:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-03 20:36:54,828 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2019-09-03 20:36:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,828 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-03 20:36:54,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:36:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-03 20:36:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:36:54,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,829 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,830 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash -232382699, now seen corresponding path program 6 times [2019-09-03 20:36:54,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:36:54,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,908 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-03 20:36:54,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:54,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:36:54,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:54,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:55,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2019-09-03 20:36:55,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:55,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:36:55,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:36:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:55,021 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2019-09-03 20:36:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,078 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-03 20:36:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:36:55,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 20:36:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,080 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:36:55,081 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:36:55,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:36:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 20:36:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:36:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-03 20:36:55,086 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-09-03 20:36:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,087 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-03 20:36:55,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:36:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-03 20:36:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:36:55,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,088 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,088 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1032151993, now seen corresponding path program 7 times [2019-09-03 20:36:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:55,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:36:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:36:55,138 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 20:36:55,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:36:55 BoogieIcfgContainer [2019-09-03 20:36:55,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:36:55,181 INFO L168 Benchmark]: Toolchain (without parser) took 5524.60 ms. Allocated memory was 141.0 MB in the beginning and 293.1 MB in the end (delta: 152.0 MB). Free memory was 88.6 MB in the beginning and 262.8 MB in the end (delta: -174.2 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:55,182 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:36:55,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.12 ms. Allocated memory is still 141.0 MB. Free memory was 88.6 MB in the beginning and 79.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:55,184 INFO L168 Benchmark]: Boogie Preprocessor took 129.64 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 79.5 MB in the beginning and 177.9 MB in the end (delta: -98.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:55,185 INFO L168 Benchmark]: RCFGBuilder took 256.75 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 166.1 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:55,186 INFO L168 Benchmark]: TraceAbstraction took 4852.60 ms. Allocated memory was 200.3 MB in the beginning and 293.1 MB in the end (delta: 92.8 MB). Free memory was 166.1 MB in the beginning and 262.8 MB in the end (delta: -96.7 MB). Peak memory consumption was 136.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:55,189 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.21 ms. Allocated memory is still 141.0 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.12 ms. Allocated memory is still 141.0 MB. Free memory was 88.6 MB in the beginning and 79.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.64 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 79.5 MB in the beginning and 177.9 MB in the end (delta: -98.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 256.75 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 166.1 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4852.60 ms. Allocated memory was 200.3 MB in the beginning and 293.1 MB in the end (delta: 92.8 MB). Free memory was 166.1 MB in the beginning and 262.8 MB in the end (delta: -96.7 MB). Peak memory consumption was 136.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=0, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=2, n=10] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=4, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=10, n=6] [L13] i++ VAL [i=4, n=6, n=10] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=10, n=8] [L13] i++ VAL [i=5, n=8, n=10] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=10, n=12] [L13] i++ VAL [i=7, n=10, n=12] [L13] COND TRUE i<=n VAL [i=7, n=10, n=12] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=14, n=10] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=10, n=18] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 4.7s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 68 SDslu, 319 SDs, 0 SdLazy, 469 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 357 SyntacticMatches, 25 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 612 ConstructedInterpolants, 8 QuantifiedInterpolants, 46440 SizeOfPredicates, 14 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 215/1170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...