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/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:43,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:43,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:43,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:43,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:43,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:43,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:43,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:43,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:43,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:43,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:43,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:43,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:43,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:43,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:43,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:43,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:43,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:43,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:43,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:43,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:43,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:43,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:43,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:43,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:43,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:43,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:43,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:43,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:43,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:43,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:43,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:43,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:43,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:43,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:43,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:43,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:43,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:43,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:43,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:43,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:43,747 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-16 17:04:43,762 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:43,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:43,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:43,763 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:43,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:43,764 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:43,764 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:43,764 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:43,764 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:43,764 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:43,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:43,765 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:43,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:43,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:43,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:43,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:43,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:43,766 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:43,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:43,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:43,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:43,767 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:43,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:43,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:43,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:43,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:43,768 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:43,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:43,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:43,769 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:43,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:43,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:43,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:43,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:43,818 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:43,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-09-16 17:04:43,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e67cd6/8185c7cfef9a473a94680bd13a8fd656/FLAG2b1e18b7a [2019-09-16 17:04:44,403 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:44,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-09-16 17:04:44,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e67cd6/8185c7cfef9a473a94680bd13a8fd656/FLAG2b1e18b7a [2019-09-16 17:04:44,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e67cd6/8185c7cfef9a473a94680bd13a8fd656 [2019-09-16 17:04:44,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:44,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:44,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:44,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:44,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:44,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:44" (1/1) ... [2019-09-16 17:04:44,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc1d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:44, skipping insertion in model container [2019-09-16 17:04:44,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:44" (1/1) ... [2019-09-16 17:04:44,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:44,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:44,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:44,975 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:44,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:45,007 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:45,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45 WrapperNode [2019-09-16 17:04:45,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:45,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:45,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:45,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:45,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:45,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:45,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:45,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:45,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:45,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:45,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:45,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:45,451 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:45,451 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:45,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:45 BoogieIcfgContainer [2019-09-16 17:04:45,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:45,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:45,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:45,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:45,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:44" (1/3) ... [2019-09-16 17:04:45,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5312d33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:45, skipping insertion in model container [2019-09-16 17:04:45,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (2/3) ... [2019-09-16 17:04:45,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5312d33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:45, skipping insertion in model container [2019-09-16 17:04:45,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:45" (3/3) ... [2019-09-16 17:04:45,484 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-09-16 17:04:45,498 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:45,514 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:45,540 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:45,577 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:45,577 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:45,578 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:45,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:45,578 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:45,578 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:45,578 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:45,578 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-16 17:04:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:04:45,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:45,604 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:45,607 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-09-16 17:04:45,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:45,774 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-16 17:04:45,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:45,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:45,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:45,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:45,799 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-09-16 17:04:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:45,867 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2019-09-16 17:04:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:45,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 17:04:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:45,890 INFO L225 Difference]: With dead ends: 50 [2019-09-16 17:04:45,890 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 17:04:45,895 INFO L636 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-16 17:04:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 17:04:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-16 17:04:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-16 17:04:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-09-16 17:04:45,942 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-09-16 17:04:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:45,943 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-09-16 17:04:45,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-09-16 17:04:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:04:45,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:45,944 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:45,945 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-09-16 17:04:45,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:45,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:45,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,013 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-16 17:04:46,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,017 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-09-16 17:04:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,067 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2019-09-16 17:04:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 17:04:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,069 INFO L225 Difference]: With dead ends: 42 [2019-09-16 17:04:46,069 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 17:04:46,070 INFO L636 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-16 17:04:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 17:04:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-16 17:04:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-16 17:04:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-09-16 17:04:46,078 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-09-16 17:04:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,079 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-09-16 17:04:46,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-09-16 17:04:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:04:46,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,080 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,080 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-09-16 17:04:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,127 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-16 17:04:46,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,130 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-09-16 17:04:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,165 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-09-16 17:04:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 17:04:46,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,167 INFO L225 Difference]: With dead ends: 45 [2019-09-16 17:04:46,168 INFO L226 Difference]: Without dead ends: 45 [2019-09-16 17:04:46,168 INFO L636 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-16 17:04:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-16 17:04:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-16 17:04:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-16 17:04:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-09-16 17:04:46,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-09-16 17:04:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,177 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-09-16 17:04:46,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-09-16 17:04:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:04:46,178 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,178 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,178 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-09-16 17:04:46,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,215 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-16 17:04:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,217 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-09-16 17:04:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,244 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2019-09-16 17:04:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 17:04:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,246 INFO L225 Difference]: With dead ends: 74 [2019-09-16 17:04:46,247 INFO L226 Difference]: Without dead ends: 74 [2019-09-16 17:04:46,247 INFO L636 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-16 17:04:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-16 17:04:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-09-16 17:04:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-16 17:04:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-09-16 17:04:46,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-09-16 17:04:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,257 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-09-16 17:04:46,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-09-16 17:04:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:04:46,258 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,258 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,259 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-09-16 17:04:46,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,304 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-16 17:04:46,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,308 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-09-16 17:04:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,326 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2019-09-16 17:04:46,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 17:04:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,328 INFO L225 Difference]: With dead ends: 76 [2019-09-16 17:04:46,329 INFO L226 Difference]: Without dead ends: 76 [2019-09-16 17:04:46,329 INFO L636 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-16 17:04:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-16 17:04:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-16 17:04:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-16 17:04:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-09-16 17:04:46,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-09-16 17:04:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,338 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-09-16 17:04:46,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-09-16 17:04:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:46,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,339 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,340 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-09-16 17:04:46,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,373 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-16 17:04:46,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,375 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-09-16 17:04:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,401 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-09-16 17:04:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,402 INFO L225 Difference]: With dead ends: 78 [2019-09-16 17:04:46,403 INFO L226 Difference]: Without dead ends: 78 [2019-09-16 17:04:46,403 INFO L636 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-16 17:04:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-16 17:04:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-16 17:04:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-16 17:04:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-09-16 17:04:46,421 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-09-16 17:04:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,421 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-09-16 17:04:46,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-09-16 17:04:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:46,424 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,424 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,425 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-09-16 17:04:46,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,488 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-16 17:04:46,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,491 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-09-16 17:04:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,518 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2019-09-16 17:04:46,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,520 INFO L225 Difference]: With dead ends: 130 [2019-09-16 17:04:46,520 INFO L226 Difference]: Without dead ends: 130 [2019-09-16 17:04:46,521 INFO L636 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-16 17:04:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-16 17:04:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-09-16 17:04:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-16 17:04:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-16 17:04:46,530 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-09-16 17:04:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,531 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-16 17:04:46,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-16 17:04:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:46,532 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,532 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,533 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-09-16 17:04:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,568 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-16 17:04:46,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,571 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-09-16 17:04:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,616 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2019-09-16 17:04:46,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,618 INFO L225 Difference]: With dead ends: 138 [2019-09-16 17:04:46,618 INFO L226 Difference]: Without dead ends: 138 [2019-09-16 17:04:46,619 INFO L636 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-16 17:04:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-16 17:04:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-16 17:04:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-16 17:04:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-09-16 17:04:46,639 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-09-16 17:04:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,644 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-09-16 17:04:46,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-09-16 17:04:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:46,648 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,648 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,648 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-09-16 17:04:46,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,708 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-16 17:04:46,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,710 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-09-16 17:04:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,727 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2019-09-16 17:04:46,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,729 INFO L225 Difference]: With dead ends: 142 [2019-09-16 17:04:46,729 INFO L226 Difference]: Without dead ends: 142 [2019-09-16 17:04:46,730 INFO L636 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-16 17:04:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-16 17:04:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-16 17:04:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-16 17:04:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-09-16 17:04:46,739 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-09-16 17:04:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,739 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-09-16 17:04:46,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-09-16 17:04:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:46,741 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,741 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,741 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-09-16 17:04:46,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,769 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-16 17:04:46,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,770 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-09-16 17:04:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,789 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2019-09-16 17:04:46,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,794 INFO L225 Difference]: With dead ends: 234 [2019-09-16 17:04:46,795 INFO L226 Difference]: Without dead ends: 234 [2019-09-16 17:04:46,795 INFO L636 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-16 17:04:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-16 17:04:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-09-16 17:04:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-16 17:04:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-09-16 17:04:46,806 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-09-16 17:04:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,806 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-09-16 17:04:46,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-09-16 17:04:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:46,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,808 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,809 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-09-16 17:04:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,836 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-16 17:04:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,838 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-09-16 17:04:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,855 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2019-09-16 17:04:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,858 INFO L225 Difference]: With dead ends: 258 [2019-09-16 17:04:46,858 INFO L226 Difference]: Without dead ends: 258 [2019-09-16 17:04:46,859 INFO L636 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-16 17:04:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-16 17:04:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-16 17:04:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:04:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-09-16 17:04:46,882 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-09-16 17:04:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,883 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-09-16 17:04:46,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-09-16 17:04:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:46,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,885 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,885 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-09-16 17:04:46,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,927 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-16 17:04:46,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,930 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-09-16 17:04:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,944 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2019-09-16 17:04:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,947 INFO L225 Difference]: With dead ends: 266 [2019-09-16 17:04:46,947 INFO L226 Difference]: Without dead ends: 266 [2019-09-16 17:04:46,948 INFO L636 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-16 17:04:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-16 17:04:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-09-16 17:04:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-16 17:04:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-09-16 17:04:46,955 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-09-16 17:04:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,956 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-09-16 17:04:46,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-09-16 17:04:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:46,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,958 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,958 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-09-16 17:04:46,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,991 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-16 17:04:46,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,993 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-09-16 17:04:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,017 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2019-09-16 17:04:47,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,020 INFO L225 Difference]: With dead ends: 424 [2019-09-16 17:04:47,021 INFO L226 Difference]: Without dead ends: 424 [2019-09-16 17:04:47,021 INFO L636 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-16 17:04:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-16 17:04:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-09-16 17:04:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-16 17:04:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-09-16 17:04:47,032 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-09-16 17:04:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,032 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-09-16 17:04:47,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-09-16 17:04:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:47,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,034 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:47,034 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,035 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-09-16 17:04:47,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,057 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-16 17:04:47,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,059 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-09-16 17:04:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,075 INFO L93 Difference]: Finished difference Result 486 states and 533 transitions. [2019-09-16 17:04:47,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,076 INFO L225 Difference]: With dead ends: 486 [2019-09-16 17:04:47,076 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:47,077 INFO L636 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-16 17:04:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:47,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-09-16 17:04:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,078 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:47,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:47,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:47,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:47 BoogieIcfgContainer [2019-09-16 17:04:47,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:47,087 INFO L168 Benchmark]: Toolchain (without parser) took 2357.11 ms. Allocated memory was 139.5 MB in the beginning and 224.4 MB in the end (delta: 84.9 MB). Free memory was 87.0 MB in the beginning and 168.6 MB in the end (delta: -81.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:47,089 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:47,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.20 ms. Allocated memory is still 139.5 MB. Free memory was 86.8 MB in the beginning and 76.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:47,090 INFO L168 Benchmark]: Boogie Preprocessor took 137.73 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 76.9 MB in the beginning and 177.4 MB in the end (delta: -100.4 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:47,091 INFO L168 Benchmark]: RCFGBuilder took 310.96 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 162.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:47,092 INFO L168 Benchmark]: TraceAbstraction took 1622.02 ms. Allocated memory was 200.3 MB in the beginning and 224.4 MB in the end (delta: 24.1 MB). Free memory was 162.8 MB in the beginning and 168.6 MB in the end (delta: -5.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:47,096 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.20 ms. Allocated memory is still 139.5 MB. Free memory was 86.8 MB in the beginning and 76.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.73 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 76.9 MB in the beginning and 177.4 MB in the end (delta: -100.4 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 310.96 ms. Allocated memory is still 200.3 MB. Free memory was 177.4 MB in the beginning and 162.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1622.02 ms. Allocated memory was 200.3 MB in the beginning and 224.4 MB in the end (delta: 24.1 MB). Free memory was 162.8 MB in the beginning and 168.6 MB in the end (delta: -5.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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 3 procedures, 29 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...