java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:01:00,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:00,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:01:00,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:01:00,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:01:00,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:01:00,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:00,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:00,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:00,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:00,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:00,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:00,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:00,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:00,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:00,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:00,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:00,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:00,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:00,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:00,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:00,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:00,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:00,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:00,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:00,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:00,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:00,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:00,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:00,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:00,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:00,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:00,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:00,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:00,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:00,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:00,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:00,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:00,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:00,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:00,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:00,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:01:00,753 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:00,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:00,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:00,754 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:00,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:00,755 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:00,755 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:00,755 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:00,756 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:00,756 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:00,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:00,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:00,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:00,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:00,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:00,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:00,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:00,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:00,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:00,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:00,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:00,759 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:00,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:00,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:00,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:00,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:00,760 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:00,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:00,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:00,760 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:00,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:00,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:00,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:00,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:00,804 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:00,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-05 13:01:00,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3e17ba7/143ff149236f4d68bb7d95f28468da4a/FLAG6fafe275f [2019-09-05 13:01:01,287 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:01,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-05 13:01:01,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3e17ba7/143ff149236f4d68bb7d95f28468da4a/FLAG6fafe275f [2019-09-05 13:01:01,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3e17ba7/143ff149236f4d68bb7d95f28468da4a [2019-09-05 13:01:01,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:01,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:01,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:01,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:01,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:01,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:01" (1/1) ... [2019-09-05 13:01:01,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3486af01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:01, skipping insertion in model container [2019-09-05 13:01:01,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:01" (1/1) ... [2019-09-05 13:01:01,729 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:01,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:01,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:01,975 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:01,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:02,008 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:02,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02 WrapperNode [2019-09-05 13:01:02,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:02,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:02,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:02,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:02,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... [2019-09-05 13:01:02,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:02,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:02,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:02,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:02,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:02,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:02,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:01:02,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:02,494 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:02,494 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 13:01:02,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:02 BoogieIcfgContainer [2019-09-05 13:01:02,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:02,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:02,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:02,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:02,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:01:01" (1/3) ... [2019-09-05 13:01:02,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12050bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:02, skipping insertion in model container [2019-09-05 13:01:02,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:02" (2/3) ... [2019-09-05 13:01:02,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12050bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:02, skipping insertion in model container [2019-09-05 13:01:02,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:02" (3/3) ... [2019-09-05 13:01:02,526 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-09-05 13:01:02,543 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:02,552 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:01:02,568 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:01:02,594 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:02,594 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:02,595 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:02,595 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:02,595 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:02,595 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:02,595 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:02,595 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-05 13:01:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:01:02,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:02,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:02,620 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-09-05 13:01:02,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:02,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:02,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:02,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:02,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:02,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:02,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:02,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:02,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:02,834 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-09-05 13:01:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:03,007 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2019-09-05 13:01:03,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:03,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-05 13:01:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:03,021 INFO L225 Difference]: With dead ends: 48 [2019-09-05 13:01:03,021 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:01:03,023 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-05 13:01:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:01:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-05 13:01:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:01:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-09-05 13:01:03,079 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-09-05 13:01:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:03,079 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-09-05 13:01:03,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-09-05 13:01:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:01:03,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:03,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:03,082 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-09-05 13:01:03,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:03,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:03,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:03,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:03,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:03,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:03,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:03,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:03,134 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-09-05 13:01:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:03,286 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2019-09-05 13:01:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:03,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-05 13:01:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:03,291 INFO L225 Difference]: With dead ends: 54 [2019-09-05 13:01:03,291 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 13:01:03,292 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-05 13:01:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 13:01:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-05 13:01:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 13:01:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-09-05 13:01:03,319 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-09-05 13:01:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:03,320 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-09-05 13:01:03,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-09-05 13:01:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:03,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:03,323 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:03,324 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-09-05 13:01:03,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:03,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:03,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:03,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:03,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:03,413 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-09-05 13:01:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:03,516 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-09-05 13:01:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:03,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:03,520 INFO L225 Difference]: With dead ends: 54 [2019-09-05 13:01:03,520 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 13:01:03,521 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-05 13:01:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 13:01:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-05 13:01:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 13:01:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-09-05 13:01:03,531 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-09-05 13:01:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:03,532 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-09-05 13:01:03,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-09-05 13:01:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 13:01:03,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:03,533 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:03,534 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-09-05 13:01:03,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:03,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:01:03,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:03,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:03,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:03,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:03,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:03,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:03,634 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-09-05 13:01:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:03,800 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-05 13:01:03,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:03,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-05 13:01:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:03,802 INFO L225 Difference]: With dead ends: 58 [2019-09-05 13:01:03,802 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 13:01:03,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 13:01:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-05 13:01:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 13:01:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-09-05 13:01:03,811 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-09-05 13:01:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:03,811 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-09-05 13:01:03,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-09-05 13:01:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 13:01:03,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:03,813 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:03,813 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:03,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-09-05 13:01:03,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:03,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:03,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:01:03,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:03,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:03,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:03,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:03,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:03,862 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-09-05 13:01:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:03,950 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-09-05 13:01:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:03,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-05 13:01:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:03,952 INFO L225 Difference]: With dead ends: 63 [2019-09-05 13:01:03,952 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 13:01:03,952 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-05 13:01:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 13:01:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-05 13:01:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 13:01:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-09-05 13:01:03,960 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-09-05 13:01:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:03,961 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-09-05 13:01:03,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-09-05 13:01:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 13:01:03,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:03,963 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:03,963 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-09-05 13:01:03,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:03,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 13:01:04,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:04,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:04,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:04,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:04,068 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-09-05 13:01:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:04,212 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-09-05 13:01:04,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:04,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-05 13:01:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:04,215 INFO L225 Difference]: With dead ends: 72 [2019-09-05 13:01:04,215 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 13:01:04,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 13:01:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-09-05 13:01:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 13:01:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-09-05 13:01:04,231 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-09-05 13:01:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:04,232 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-09-05 13:01:04,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-09-05 13:01:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 13:01:04,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:04,238 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:04,238 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-09-05 13:01:04,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:04,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:04,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:04,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:04,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 13:01:04,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:04,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 13:01:04,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:04,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:01:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:01:04,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:04,366 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-09-05 13:01:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:04,535 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-09-05 13:01:04,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:01:04,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-05 13:01:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:04,537 INFO L225 Difference]: With dead ends: 72 [2019-09-05 13:01:04,537 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 13:01:04,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:01:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 13:01:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-05 13:01:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 13:01:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-09-05 13:01:04,545 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-09-05 13:01:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:04,545 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-09-05 13:01:04,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:01:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-09-05 13:01:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-05 13:01:04,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:04,547 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:04,548 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-09-05 13:01:04,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:04,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:04,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:04,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:04,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 13:01:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:04,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-05 13:01:04,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:04,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:01:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:01:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:04,641 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-09-05 13:01:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:04,837 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2019-09-05 13:01:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:01:04,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-05 13:01:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:04,838 INFO L225 Difference]: With dead ends: 70 [2019-09-05 13:01:04,838 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:04,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:01:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:04,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-09-05 13:01:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:04,840 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:04,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:01:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:04,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:04,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:04 BoogieIcfgContainer [2019-09-05 13:01:04,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:04,854 INFO L168 Benchmark]: Toolchain (without parser) took 3140.65 ms. Allocated memory was 132.6 MB in the beginning and 260.0 MB in the end (delta: 127.4 MB). Free memory was 87.6 MB in the beginning and 232.9 MB in the end (delta: -145.4 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:04,855 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:01:04,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.08 ms. Allocated memory is still 132.6 MB. Free memory was 87.4 MB in the beginning and 77.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:04,857 INFO L168 Benchmark]: Boogie Preprocessor took 128.11 ms. Allocated memory was 132.6 MB in the beginning and 198.2 MB in the end (delta: 65.5 MB). Free memory was 77.5 MB in the beginning and 174.2 MB in the end (delta: -96.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:04,858 INFO L168 Benchmark]: RCFGBuilder took 369.64 ms. Allocated memory is still 198.2 MB. Free memory was 174.2 MB in the beginning and 159.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:04,859 INFO L168 Benchmark]: TraceAbstraction took 2342.70 ms. Allocated memory was 198.2 MB in the beginning and 260.0 MB in the end (delta: 61.9 MB). Free memory was 159.5 MB in the beginning and 232.9 MB in the end (delta: -73.4 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:04,863 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 132.6 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.08 ms. Allocated memory is still 132.6 MB. Free memory was 87.4 MB in the beginning and 77.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.11 ms. Allocated memory was 132.6 MB in the beginning and 198.2 MB in the end (delta: 65.5 MB). Free memory was 77.5 MB in the beginning and 174.2 MB in the end (delta: -96.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 369.64 ms. Allocated memory is still 198.2 MB. Free memory was 174.2 MB in the beginning and 159.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2342.70 ms. Allocated memory was 198.2 MB in the beginning and 260.0 MB in the end (delta: 61.9 MB). Free memory was 159.5 MB in the beginning and 232.9 MB in the end (delta: -73.4 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 395 SDtfs, 102 SDslu, 1026 SDs, 0 SdLazy, 528 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 23798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...