java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:11:21,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:11:21,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:11:21,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:11:21,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:11:21,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:11:21,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:11:21,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:11:21,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:11:21,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:11:21,676 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:11:21,677 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:11:21,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:11:21,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:11:21,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:11:21,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:11:21,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:11:21,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:11:21,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:11:21,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:11:21,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:11:21,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:11:21,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:11:21,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:11:21,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:11:21,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:11:21,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:11:21,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:11:21,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:11:21,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:11:21,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:11:21,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:11:21,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:11:21,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:11:21,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:11:21,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:11:21,704 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:11:21,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:11:21,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:11:21,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:11:21,733 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:11:21,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:11:21,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:11:21,734 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:11:21,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:11:21,734 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:11:21,734 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:11:21,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:11:21,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:11:21,736 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:11:21,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:11:21,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:11:21,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:11:21,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:11:21,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:11:21,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:11:21,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:11:21,739 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:11:21,739 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:11:21,739 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:11:21,739 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:11:21,740 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:11:21,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:11:21,740 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:11:21,740 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:11:21,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:11:21,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:11:21,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:11:21,808 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:11:21,809 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:11:21,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c [2018-11-06 19:11:21,870 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c58458a5/b1eb61bd98ef4093b5530d93b54d8c33/FLAG749ac6d7c [2018-11-06 19:11:22,735 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:11:22,736 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c [2018-11-06 19:11:22,772 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c58458a5/b1eb61bd98ef4093b5530d93b54d8c33/FLAG749ac6d7c [2018-11-06 19:11:22,791 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c58458a5/b1eb61bd98ef4093b5530d93b54d8c33 [2018-11-06 19:11:22,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:11:22,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:11:22,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:11:22,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:11:22,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:11:22,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:11:22" (1/1) ... [2018-11-06 19:11:22,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596e7265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:22, skipping insertion in model container [2018-11-06 19:11:22,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:11:22" (1/1) ... [2018-11-06 19:11:22,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:11:22,987 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:11:24,455 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:11:24,460 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:11:25,246 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:11:25,286 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:11:25,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25 WrapperNode [2018-11-06 19:11:25,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:11:25,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:11:25,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:11:25,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:11:25,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:25,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:11:26,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:11:26,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:11:26,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:11:26,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (1/1) ... [2018-11-06 19:11:26,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:11:26,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:11:26,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:11:26,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:11:26,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (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 [2018-11-06 19:11:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:11:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:11:26,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:11:37,484 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:11:37,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:11:37 BoogieIcfgContainer [2018-11-06 19:11:37,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:11:37,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:11:37,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:11:37,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:11:37,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:11:22" (1/3) ... [2018-11-06 19:11:37,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390eedf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:11:37, skipping insertion in model container [2018-11-06 19:11:37,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:25" (2/3) ... [2018-11-06 19:11:37,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390eedf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:11:37, skipping insertion in model container [2018-11-06 19:11:37,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:11:37" (3/3) ... [2018-11-06 19:11:37,494 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label29_false-unreach-call.c [2018-11-06 19:11:37,504 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:11:37,517 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:11:37,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:11:37,590 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:11:37,590 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:11:37,591 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:11:37,591 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:11:37,591 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:11:37,591 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:11:37,591 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:11:37,591 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:11:37,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:11:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:11:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-06 19:11:37,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:37,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:37,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:37,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1961166346, now seen corresponding path program 1 times [2018-11-06 19:11:37,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:37,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:37,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:38,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:38,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:38,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:38,048 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 19:11:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:51,488 INFO L93 Difference]: Finished difference Result 3896 states and 7286 transitions. [2018-11-06 19:11:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:51,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-06 19:11:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:51,538 INFO L225 Difference]: With dead ends: 3896 [2018-11-06 19:11:51,538 INFO L226 Difference]: Without dead ends: 2790 [2018-11-06 19:11:51,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2018-11-06 19:11:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1945. [2018-11-06 19:11:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-06 19:11:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3412 transitions. [2018-11-06 19:11:51,716 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3412 transitions. Word has length 15 [2018-11-06 19:11:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:51,717 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 3412 transitions. [2018-11-06 19:11:51,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3412 transitions. [2018-11-06 19:11:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-06 19:11:51,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:51,722 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:51,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:51,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:51,724 INFO L82 PathProgramCache]: Analyzing trace with hash 705130049, now seen corresponding path program 1 times [2018-11-06 19:11:51,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:51,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:51,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:51,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:51,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:52,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:52,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:11:52,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:11:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:11:52,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:11:52,509 INFO L87 Difference]: Start difference. First operand 1945 states and 3412 transitions. Second operand 5 states. [2018-11-06 19:11:52,758 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-06 19:12:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:06,210 INFO L93 Difference]: Finished difference Result 7061 states and 12475 transitions. [2018-11-06 19:12:06,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:06,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-06 19:12:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:06,236 INFO L225 Difference]: With dead ends: 7061 [2018-11-06 19:12:06,236 INFO L226 Difference]: Without dead ends: 5118 [2018-11-06 19:12:06,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:12:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2018-11-06 19:12:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5117. [2018-11-06 19:12:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2018-11-06 19:12:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7612 transitions. [2018-11-06 19:12:06,343 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7612 transitions. Word has length 81 [2018-11-06 19:12:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:06,344 INFO L480 AbstractCegarLoop]: Abstraction has 5117 states and 7612 transitions. [2018-11-06 19:12:06,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7612 transitions. [2018-11-06 19:12:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-06 19:12:06,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:06,352 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:06,352 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:06,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:06,352 INFO L82 PathProgramCache]: Analyzing trace with hash 795908766, now seen corresponding path program 1 times [2018-11-06 19:12:06,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:06,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:06,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:12:06,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:06,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:12:06,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:12:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:12:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:06,536 INFO L87 Difference]: Start difference. First operand 5117 states and 7612 transitions. Second operand 3 states. [2018-11-06 19:12:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:11,398 INFO L93 Difference]: Finished difference Result 10220 states and 15517 transitions. [2018-11-06 19:12:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:12:11,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-11-06 19:12:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:11,430 INFO L225 Difference]: With dead ends: 10220 [2018-11-06 19:12:11,430 INFO L226 Difference]: Without dead ends: 5893 [2018-11-06 19:12:11,437 INFO L604 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 [2018-11-06 19:12:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-11-06 19:12:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5892. [2018-11-06 19:12:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5892 states. [2018-11-06 19:12:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 7437 transitions. [2018-11-06 19:12:11,555 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 7437 transitions. Word has length 141 [2018-11-06 19:12:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:11,556 INFO L480 AbstractCegarLoop]: Abstraction has 5892 states and 7437 transitions. [2018-11-06 19:12:11,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:12:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 7437 transitions. [2018-11-06 19:12:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 19:12:11,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:11,569 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:12:11,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:11,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash -497336603, now seen corresponding path program 1 times [2018-11-06 19:12:11,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 19:12:11,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:12:11,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:12:12,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:12,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:12:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:12:12,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:12:12,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-11-06 19:12:12,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:12,247 INFO L87 Difference]: Start difference. First operand 5892 states and 7437 transitions. Second operand 5 states. [2018-11-06 19:12:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:22,708 INFO L93 Difference]: Finished difference Result 20501 states and 27031 transitions. [2018-11-06 19:12:22,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:22,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2018-11-06 19:12:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:22,775 INFO L225 Difference]: With dead ends: 20501 [2018-11-06 19:12:22,776 INFO L226 Difference]: Without dead ends: 15399 [2018-11-06 19:12:22,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15399 states. [2018-11-06 19:12:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15399 to 10627. [2018-11-06 19:12:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2018-11-06 19:12:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 13141 transitions. [2018-11-06 19:12:23,049 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 13141 transitions. Word has length 180 [2018-11-06 19:12:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:23,050 INFO L480 AbstractCegarLoop]: Abstraction has 10627 states and 13141 transitions. [2018-11-06 19:12:23,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 13141 transitions. [2018-11-06 19:12:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-06 19:12:23,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:23,055 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:23,055 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:23,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash -280236202, now seen corresponding path program 1 times [2018-11-06 19:12:23,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:23,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:23,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:23,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:23,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 19:12:23,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:23,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:12:23,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:12:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:12:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:23,479 INFO L87 Difference]: Start difference. First operand 10627 states and 13141 transitions. Second operand 3 states. [2018-11-06 19:12:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:28,409 INFO L93 Difference]: Finished difference Result 28343 states and 35767 transitions. [2018-11-06 19:12:28,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:12:28,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-11-06 19:12:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:28,453 INFO L225 Difference]: With dead ends: 28343 [2018-11-06 19:12:28,454 INFO L226 Difference]: Without dead ends: 18506 [2018-11-06 19:12:28,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18506 states. [2018-11-06 19:12:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18506 to 18505. [2018-11-06 19:12:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18505 states. [2018-11-06 19:12:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18505 states to 18505 states and 22008 transitions. [2018-11-06 19:12:28,795 INFO L78 Accepts]: Start accepts. Automaton has 18505 states and 22008 transitions. Word has length 191 [2018-11-06 19:12:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:28,795 INFO L480 AbstractCegarLoop]: Abstraction has 18505 states and 22008 transitions. [2018-11-06 19:12:28,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:12:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 18505 states and 22008 transitions. [2018-11-06 19:12:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-06 19:12:28,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:28,803 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:12:28,803 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:28,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1522111001, now seen corresponding path program 1 times [2018-11-06 19:12:28,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:28,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:28,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:28,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 19:12:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:12:29,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:12:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:12:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:29,172 INFO L87 Difference]: Start difference. First operand 18505 states and 22008 transitions. Second operand 3 states. [2018-11-06 19:12:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:34,994 INFO L93 Difference]: Finished difference Result 36218 states and 43220 transitions. [2018-11-06 19:12:34,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:12:34,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-11-06 19:12:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:35,033 INFO L225 Difference]: With dead ends: 36218 [2018-11-06 19:12:35,033 INFO L226 Difference]: Without dead ends: 18503 [2018-11-06 19:12:35,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2018-11-06 19:12:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 18502. [2018-11-06 19:12:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2018-11-06 19:12:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 21047 transitions. [2018-11-06 19:12:35,304 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 21047 transitions. Word has length 229 [2018-11-06 19:12:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:35,304 INFO L480 AbstractCegarLoop]: Abstraction has 18502 states and 21047 transitions. [2018-11-06 19:12:35,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:12:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 21047 transitions. [2018-11-06 19:12:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-11-06 19:12:35,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:35,312 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:35,312 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:35,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash -14624985, now seen corresponding path program 1 times [2018-11-06 19:12:35,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:35,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:35,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:35,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:35,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-06 19:12:35,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:35,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:35,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:35,793 INFO L87 Difference]: Start difference. First operand 18502 states and 21047 transitions. Second operand 4 states. [2018-11-06 19:12:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:46,276 INFO L93 Difference]: Finished difference Result 66979 states and 76824 transitions. [2018-11-06 19:12:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:46,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2018-11-06 19:12:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:46,356 INFO L225 Difference]: With dead ends: 66979 [2018-11-06 19:12:46,356 INFO L226 Difference]: Without dead ends: 47675 [2018-11-06 19:12:46,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47675 states. [2018-11-06 19:12:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47675 to 46857. [2018-11-06 19:12:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46857 states. [2018-11-06 19:12:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46857 states to 46857 states and 51707 transitions. [2018-11-06 19:12:46,950 INFO L78 Accepts]: Start accepts. Automaton has 46857 states and 51707 transitions. Word has length 310 [2018-11-06 19:12:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:46,950 INFO L480 AbstractCegarLoop]: Abstraction has 46857 states and 51707 transitions. [2018-11-06 19:12:46,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 46857 states and 51707 transitions. [2018-11-06 19:12:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-11-06 19:12:46,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:46,962 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:46,963 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:46,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1362845449, now seen corresponding path program 1 times [2018-11-06 19:12:46,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:46,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 19:12:47,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:47,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:47,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:47,498 INFO L87 Difference]: Start difference. First operand 46857 states and 51707 transitions. Second operand 5 states. [2018-11-06 19:13:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:03,662 INFO L93 Difference]: Finished difference Result 186967 states and 206415 transitions. [2018-11-06 19:13:03,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:13:03,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2018-11-06 19:13:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:03,858 INFO L225 Difference]: With dead ends: 186967 [2018-11-06 19:13:03,859 INFO L226 Difference]: Without dead ends: 140900 [2018-11-06 19:13:03,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:13:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140900 states. [2018-11-06 19:13:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140900 to 128897. [2018-11-06 19:13:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128897 states. [2018-11-06 19:13:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128897 states to 128897 states and 140147 transitions. [2018-11-06 19:13:05,479 INFO L78 Accepts]: Start accepts. Automaton has 128897 states and 140147 transitions. Word has length 372 [2018-11-06 19:13:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:05,479 INFO L480 AbstractCegarLoop]: Abstraction has 128897 states and 140147 transitions. [2018-11-06 19:13:05,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:13:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 128897 states and 140147 transitions. [2018-11-06 19:13:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-11-06 19:13:05,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:05,495 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:05,495 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:05,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:05,496 INFO L82 PathProgramCache]: Analyzing trace with hash 42662170, now seen corresponding path program 1 times [2018-11-06 19:13:05,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:05,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:05,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:06,009 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:13:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 19:13:06,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:06,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:06,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:06,107 INFO L87 Difference]: Start difference. First operand 128897 states and 140147 transitions. Second operand 4 states. [2018-11-06 19:13:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:15,572 INFO L93 Difference]: Finished difference Result 294862 states and 320990 transitions. [2018-11-06 19:13:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:15,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2018-11-06 19:13:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:15,780 INFO L225 Difference]: With dead ends: 294862 [2018-11-06 19:13:15,781 INFO L226 Difference]: Without dead ends: 166755 [2018-11-06 19:13:15,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166755 states. [2018-11-06 19:13:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166755 to 164358. [2018-11-06 19:13:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164358 states. [2018-11-06 19:13:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164358 states to 164358 states and 175545 transitions. [2018-11-06 19:13:18,007 INFO L78 Accepts]: Start accepts. Automaton has 164358 states and 175545 transitions. Word has length 400 [2018-11-06 19:13:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 164358 states and 175545 transitions. [2018-11-06 19:13:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 164358 states and 175545 transitions. [2018-11-06 19:13:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-11-06 19:13:18,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:18,037 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:18,037 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:18,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1917767430, now seen corresponding path program 1 times [2018-11-06 19:13:18,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-06 19:13:18,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:18,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:13:18,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:13:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:13:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:13:18,434 INFO L87 Difference]: Start difference. First operand 164358 states and 175545 transitions. Second operand 3 states. [2018-11-06 19:13:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:21,924 INFO L93 Difference]: Finished difference Result 326335 states and 348424 transitions. [2018-11-06 19:13:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:13:21,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2018-11-06 19:13:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:22,090 INFO L225 Difference]: With dead ends: 326335 [2018-11-06 19:13:22,090 INFO L226 Difference]: Without dead ends: 162765 [2018-11-06 19:13:22,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:13:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162765 states. [2018-11-06 19:13:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162765 to 162765. [2018-11-06 19:13:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162765 states. [2018-11-06 19:13:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162765 states to 162765 states and 173651 transitions. [2018-11-06 19:13:25,012 INFO L78 Accepts]: Start accepts. Automaton has 162765 states and 173651 transitions. Word has length 498 [2018-11-06 19:13:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:25,013 INFO L480 AbstractCegarLoop]: Abstraction has 162765 states and 173651 transitions. [2018-11-06 19:13:25,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:13:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 162765 states and 173651 transitions. [2018-11-06 19:13:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-11-06 19:13:25,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:25,033 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:25,033 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:25,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1448449607, now seen corresponding path program 1 times [2018-11-06 19:13:25,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:25,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:25,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-06 19:13:25,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:25,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:25,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:25,578 INFO L87 Difference]: Start difference. First operand 162765 states and 173651 transitions. Second operand 4 states. [2018-11-06 19:13:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:34,716 INFO L93 Difference]: Finished difference Result 349192 states and 372453 transitions. [2018-11-06 19:13:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:34,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 512 [2018-11-06 19:13:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:34,904 INFO L225 Difference]: With dead ends: 349192 [2018-11-06 19:13:34,904 INFO L226 Difference]: Without dead ends: 187217 [2018-11-06 19:13:34,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187217 states. [2018-11-06 19:13:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187217 to 166704. [2018-11-06 19:13:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166704 states. [2018-11-06 19:13:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166704 states to 166704 states and 176539 transitions. [2018-11-06 19:13:36,435 INFO L78 Accepts]: Start accepts. Automaton has 166704 states and 176539 transitions. Word has length 512 [2018-11-06 19:13:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:36,436 INFO L480 AbstractCegarLoop]: Abstraction has 166704 states and 176539 transitions. [2018-11-06 19:13:36,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166704 states and 176539 transitions. [2018-11-06 19:13:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-11-06 19:13:36,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:36,456 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:36,456 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:36,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 394135499, now seen corresponding path program 1 times [2018-11-06 19:13:36,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:36,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 577 proven. 66 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 19:13:38,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:13:38,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:13:38,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:38,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:13:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-06 19:13:39,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:13:39,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-11-06 19:13:39,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:13:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:13:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:13:39,523 INFO L87 Difference]: Start difference. First operand 166704 states and 176539 transitions. Second operand 9 states. [2018-11-06 19:14:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:33,520 INFO L93 Difference]: Finished difference Result 462880 states and 491621 transitions. [2018-11-06 19:14:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 19:14:33,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 564 [2018-11-06 19:14:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:33,838 INFO L225 Difference]: With dead ends: 462880 [2018-11-06 19:14:33,838 INFO L226 Difference]: Without dead ends: 270107 [2018-11-06 19:14:33,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-06 19:14:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270107 states. [2018-11-06 19:14:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270107 to 227342. [2018-11-06 19:14:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227342 states. [2018-11-06 19:14:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227342 states to 227342 states and 236089 transitions. [2018-11-06 19:14:37,400 INFO L78 Accepts]: Start accepts. Automaton has 227342 states and 236089 transitions. Word has length 564 [2018-11-06 19:14:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 227342 states and 236089 transitions. [2018-11-06 19:14:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:14:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 227342 states and 236089 transitions. [2018-11-06 19:14:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-11-06 19:14:37,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:37,412 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:14:37,412 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:37,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1990171556, now seen corresponding path program 1 times [2018-11-06 19:14:37,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:37,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:37,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:37,752 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:14:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-06 19:14:37,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:37,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:14:37,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:37,927 INFO L87 Difference]: Start difference. First operand 227342 states and 236089 transitions. Second operand 4 states. [2018-11-06 19:14:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:45,314 INFO L93 Difference]: Finished difference Result 461776 states and 479474 transitions. [2018-11-06 19:14:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:45,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 585 [2018-11-06 19:14:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:45,560 INFO L225 Difference]: With dead ends: 461776 [2018-11-06 19:14:45,560 INFO L226 Difference]: Without dead ends: 225744 [2018-11-06 19:14:45,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225744 states. [2018-11-06 19:14:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225744 to 219438. [2018-11-06 19:14:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219438 states. [2018-11-06 19:14:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219438 states to 219438 states and 227055 transitions. [2018-11-06 19:14:48,457 INFO L78 Accepts]: Start accepts. Automaton has 219438 states and 227055 transitions. Word has length 585 [2018-11-06 19:14:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:48,458 INFO L480 AbstractCegarLoop]: Abstraction has 219438 states and 227055 transitions. [2018-11-06 19:14:48,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 219438 states and 227055 transitions. [2018-11-06 19:14:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2018-11-06 19:14:48,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:48,471 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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] [2018-11-06 19:14:48,471 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:48,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 509555431, now seen corresponding path program 1 times [2018-11-06 19:14:48,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:48,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:48,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-06 19:14:49,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:49,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:49,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:49,971 INFO L87 Difference]: Start difference. First operand 219438 states and 227055 transitions. Second operand 4 states. [2018-11-06 19:14:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:58,079 INFO L93 Difference]: Finished difference Result 434943 states and 450072 transitions. [2018-11-06 19:14:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:58,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 769 [2018-11-06 19:14:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:58,345 INFO L225 Difference]: With dead ends: 434943 [2018-11-06 19:14:58,345 INFO L226 Difference]: Without dead ends: 216295 [2018-11-06 19:14:58,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216295 states. [2018-11-06 19:15:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216295 to 207607. [2018-11-06 19:15:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207607 states. [2018-11-06 19:15:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207607 states to 207607 states and 213136 transitions. [2018-11-06 19:15:01,009 INFO L78 Accepts]: Start accepts. Automaton has 207607 states and 213136 transitions. Word has length 769 [2018-11-06 19:15:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:01,010 INFO L480 AbstractCegarLoop]: Abstraction has 207607 states and 213136 transitions. [2018-11-06 19:15:01,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 207607 states and 213136 transitions. [2018-11-06 19:15:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-11-06 19:15:01,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:01,022 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:15:01,023 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:01,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1083827949, now seen corresponding path program 1 times [2018-11-06 19:15:01,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:01,824 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-11-06 19:15:02,191 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 8 [2018-11-06 19:15:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-06 19:15:03,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:03,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:15:03,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:15:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:15:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:15:03,368 INFO L87 Difference]: Start difference. First operand 207607 states and 213136 transitions. Second operand 6 states. Received shutdown request... [2018-11-06 19:15:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:15:09,188 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:15:09,195 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:15:09,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:15:09 BoogieIcfgContainer [2018-11-06 19:15:09,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:15:09,196 INFO L168 Benchmark]: Toolchain (without parser) took 226391.92 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 191.1 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,198 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:15:09,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2481.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 861.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 804.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -997.2 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,200 INFO L168 Benchmark]: Boogie Preprocessor took 643.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,201 INFO L168 Benchmark]: RCFGBuilder took 10691.09 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 245.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 580.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,202 INFO L168 Benchmark]: TraceAbstraction took 211709.52 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 1.2 GB in the end (delta: 838.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,207 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2481.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 861.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 804.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -997.2 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 643.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10691.09 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 245.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 580.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211709.52 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 1.2 GB in the end (delta: 838.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (207607states) and FLOYD_HOARE automaton (currently 6 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (35994 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 211.6s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 179.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12040 SDtfs, 45209 SDslu, 4138 SDs, 0 SdLazy, 93381 SolverSat, 19553 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 141.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 773 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227342occurred in iteration=12, 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: 18.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 99111 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 6446 NumberOfCodeBlocks, 6446 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6429 ConstructedInterpolants, 90 QuantifiedInterpolants, 7864887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1022 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 8110/8242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown