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/Problem11_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:02:15,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:02:15,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:02:15,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:02:15,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:02:15,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:02:15,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:02:15,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:02:15,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:02:15,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:02:15,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:02:15,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:02:15,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:02:15,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:02:15,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:02:15,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:02:15,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:02:15,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:02:15,595 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:02:15,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:02:15,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:02:15,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:02:15,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:02:15,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:02:15,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:02:15,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:02:15,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:02:15,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:02:15,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:02:15,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:02:15,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:02:15,616 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:02:15,616 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:02:15,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:02:15,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:02:15,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:02:15,621 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 21:02:15,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:02:15,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:02:15,645 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:02:15,646 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:02:15,646 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:02:15,646 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:02:15,647 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:02:15,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:02:15,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:02:15,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:02:15,648 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:02:15,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:02:15,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:02:15,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:02:15,649 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:02:15,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:02:15,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:02:15,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:02:15,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:02:15,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:02:15,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:02:15,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:02:15,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:02:15,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:02:15,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:02:15,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:02:15,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:02:15,652 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:02:15,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:02:15,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:02:15,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:02:15,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:02:15,719 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:02:15,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-11-06 21:02:15,783 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbae32e2/22438cae576a44fd8b8b4f7f1f3d856a/FLAGacb6640e1 [2018-11-06 21:02:16,371 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:02:16,373 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-11-06 21:02:16,393 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbae32e2/22438cae576a44fd8b8b4f7f1f3d856a/FLAGacb6640e1 [2018-11-06 21:02:16,417 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbae32e2/22438cae576a44fd8b8b4f7f1f3d856a [2018-11-06 21:02:16,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:02:16,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:02:16,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:16,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:02:16,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:02:16,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:16" (1/1) ... [2018-11-06 21:02:16,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567b4d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:16, skipping insertion in model container [2018-11-06 21:02:16,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:16" (1/1) ... [2018-11-06 21:02:16,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:02:16,533 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:02:17,165 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:17,170 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:02:17,348 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:17,367 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:02:17,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17 WrapperNode [2018-11-06 21:02:17,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:17,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:17,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:02:17,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:02:17,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:17,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:02:17,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:02:17,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:02:17,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (1/1) ... [2018-11-06 21:02:17,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:02:17,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:02:17,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:02:17,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:02:17,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (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 21:02:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:02:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:02:17,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:02:22,530 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:02:22,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:22 BoogieIcfgContainer [2018-11-06 21:02:22,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:02:22,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:02:22,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:02:22,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:02:22,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:02:16" (1/3) ... [2018-11-06 21:02:22,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ee10d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:22, skipping insertion in model container [2018-11-06 21:02:22,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:17" (2/3) ... [2018-11-06 21:02:22,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ee10d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:22, skipping insertion in model container [2018-11-06 21:02:22,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:22" (3/3) ... [2018-11-06 21:02:22,540 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label11_true-unreach-call.c [2018-11-06 21:02:22,550 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:02:22,559 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:02:22,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:02:22,615 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:02:22,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:02:22,616 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:02:22,617 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:02:22,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:02:22,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:02:22,618 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:02:22,618 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:02:22,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:02:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:02:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-06 21:02:22,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:22,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:02:22,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:22,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1515441142, now seen corresponding path program 1 times [2018-11-06 21:02:22,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:22,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:23,257 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 21:02:23,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:23,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:23,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:23,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:23,285 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:02:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:26,500 INFO L93 Difference]: Finished difference Result 961 states and 1728 transitions. [2018-11-06 21:02:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:26,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-06 21:02:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:26,528 INFO L225 Difference]: With dead ends: 961 [2018-11-06 21:02:26,528 INFO L226 Difference]: Without dead ends: 670 [2018-11-06 21:02:26,534 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 21:02:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-06 21:02:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-11-06 21:02:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-06 21:02:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1024 transitions. [2018-11-06 21:02:26,624 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1024 transitions. Word has length 62 [2018-11-06 21:02:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:26,625 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 1024 transitions. [2018-11-06 21:02:26,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1024 transitions. [2018-11-06 21:02:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-06 21:02:26,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:26,637 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:02:26,637 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:26,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 439607983, now seen corresponding path program 1 times [2018-11-06 21:02:26,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:26,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:26,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:27,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:27,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:27,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:27,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:27,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:27,100 INFO L87 Difference]: Start difference. First operand 670 states and 1024 transitions. Second operand 4 states. [2018-11-06 21:02:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:31,926 INFO L93 Difference]: Finished difference Result 2478 states and 3869 transitions. [2018-11-06 21:02:31,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:31,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-06 21:02:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:31,939 INFO L225 Difference]: With dead ends: 2478 [2018-11-06 21:02:31,939 INFO L226 Difference]: Without dead ends: 1810 [2018-11-06 21:02:31,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:02:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2018-11-06 21:02:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1226. [2018-11-06 21:02:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-11-06 21:02:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1709 transitions. [2018-11-06 21:02:32,036 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1709 transitions. Word has length 139 [2018-11-06 21:02:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:32,036 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 1709 transitions. [2018-11-06 21:02:32,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1709 transitions. [2018-11-06 21:02:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-06 21:02:32,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:32,048 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:02:32,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:32,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1794831649, now seen corresponding path program 1 times [2018-11-06 21:02:32,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:32,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:32,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:32,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:32,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:32,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:32,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:32,377 INFO L87 Difference]: Start difference. First operand 1226 states and 1709 transitions. Second operand 4 states. [2018-11-06 21:02:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:34,930 INFO L93 Difference]: Finished difference Result 4138 states and 5963 transitions. [2018-11-06 21:02:34,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:34,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-06 21:02:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:34,947 INFO L225 Difference]: With dead ends: 4138 [2018-11-06 21:02:34,947 INFO L226 Difference]: Without dead ends: 2914 [2018-11-06 21:02:34,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:02:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2018-11-06 21:02:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2151. [2018-11-06 21:02:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2018-11-06 21:02:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2800 transitions. [2018-11-06 21:02:34,998 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2800 transitions. Word has length 190 [2018-11-06 21:02:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:34,999 INFO L480 AbstractCegarLoop]: Abstraction has 2151 states and 2800 transitions. [2018-11-06 21:02:34,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2800 transitions. [2018-11-06 21:02:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-06 21:02:35,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:35,003 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:35,004 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:35,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1441746538, now seen corresponding path program 1 times [2018-11-06 21:02:35,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:35,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:35,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:35,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-06 21:02:35,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:35,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:35,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:35,309 INFO L87 Difference]: Start difference. First operand 2151 states and 2800 transitions. Second operand 4 states. [2018-11-06 21:02:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:38,458 INFO L93 Difference]: Finished difference Result 7462 states and 9948 transitions. [2018-11-06 21:02:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:38,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-11-06 21:02:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:38,484 INFO L225 Difference]: With dead ends: 7462 [2018-11-06 21:02:38,484 INFO L226 Difference]: Without dead ends: 5313 [2018-11-06 21:02:38,489 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 21:02:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2018-11-06 21:02:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5111. [2018-11-06 21:02:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5111 states. [2018-11-06 21:02:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5111 states to 5111 states and 6491 transitions. [2018-11-06 21:02:38,604 INFO L78 Accepts]: Start accepts. Automaton has 5111 states and 6491 transitions. Word has length 208 [2018-11-06 21:02:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:38,604 INFO L480 AbstractCegarLoop]: Abstraction has 5111 states and 6491 transitions. [2018-11-06 21:02:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5111 states and 6491 transitions. [2018-11-06 21:02:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-06 21:02:38,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:38,614 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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 21:02:38,614 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:38,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1315185902, now seen corresponding path program 1 times [2018-11-06 21:02:38,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-06 21:02:38,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:38,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:38,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:02:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:02:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:02:38,971 INFO L87 Difference]: Start difference. First operand 5111 states and 6491 transitions. Second operand 3 states. [2018-11-06 21:02:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:40,921 INFO L93 Difference]: Finished difference Result 11883 states and 15322 transitions. [2018-11-06 21:02:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:02:40,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-11-06 21:02:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:40,952 INFO L225 Difference]: With dead ends: 11883 [2018-11-06 21:02:40,952 INFO L226 Difference]: Without dead ends: 6959 [2018-11-06 21:02:40,959 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 21:02:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2018-11-06 21:02:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6959. [2018-11-06 21:02:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6959 states. [2018-11-06 21:02:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 8768 transitions. [2018-11-06 21:02:41,069 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 8768 transitions. Word has length 252 [2018-11-06 21:02:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:41,070 INFO L480 AbstractCegarLoop]: Abstraction has 6959 states and 8768 transitions. [2018-11-06 21:02:41,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:02:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 8768 transitions. [2018-11-06 21:02:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-06 21:02:41,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:41,078 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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] [2018-11-06 21:02:41,078 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:41,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 484844517, now seen corresponding path program 1 times [2018-11-06 21:02:41,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:41,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:41,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:41,440 INFO L87 Difference]: Start difference. First operand 6959 states and 8768 transitions. Second operand 4 states. [2018-11-06 21:02:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:43,503 INFO L93 Difference]: Finished difference Result 18185 states and 23270 transitions. [2018-11-06 21:02:43,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:43,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-11-06 21:02:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:43,547 INFO L225 Difference]: With dead ends: 18185 [2018-11-06 21:02:43,548 INFO L226 Difference]: Without dead ends: 11413 [2018-11-06 21:02:43,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:02:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11413 states. [2018-11-06 21:02:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11413 to 11029. [2018-11-06 21:02:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11029 states. [2018-11-06 21:02:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11029 states to 11029 states and 13573 transitions. [2018-11-06 21:02:43,716 INFO L78 Accepts]: Start accepts. Automaton has 11029 states and 13573 transitions. Word has length 268 [2018-11-06 21:02:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:43,717 INFO L480 AbstractCegarLoop]: Abstraction has 11029 states and 13573 transitions. [2018-11-06 21:02:43,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11029 states and 13573 transitions. [2018-11-06 21:02:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-06 21:02:43,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:43,734 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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 21:02:43,734 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:43,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash 955286133, now seen corresponding path program 1 times [2018-11-06 21:02:43,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:43,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:43,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:43,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:43,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-06 21:02:44,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:44,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:44,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:02:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:02:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:02:44,041 INFO L87 Difference]: Start difference. First operand 11029 states and 13573 transitions. Second operand 3 states. [2018-11-06 21:02:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:45,396 INFO L93 Difference]: Finished difference Result 21499 states and 26551 transitions. [2018-11-06 21:02:45,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:02:45,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2018-11-06 21:02:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:45,416 INFO L225 Difference]: With dead ends: 21499 [2018-11-06 21:02:45,417 INFO L226 Difference]: Without dead ends: 10657 [2018-11-06 21:02:45,429 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 21:02:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2018-11-06 21:02:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 10656. [2018-11-06 21:02:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10656 states. [2018-11-06 21:02:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10656 states to 10656 states and 12526 transitions. [2018-11-06 21:02:45,569 INFO L78 Accepts]: Start accepts. Automaton has 10656 states and 12526 transitions. Word has length 344 [2018-11-06 21:02:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:45,570 INFO L480 AbstractCegarLoop]: Abstraction has 10656 states and 12526 transitions. [2018-11-06 21:02:45,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:02:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10656 states and 12526 transitions. [2018-11-06 21:02:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-06 21:02:45,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:45,591 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:45,591 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:45,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1928196445, now seen corresponding path program 1 times [2018-11-06 21:02:45,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:45,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:45,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:45,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-06 21:02:45,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:45,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:45,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:02:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:02:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:02:45,891 INFO L87 Difference]: Start difference. First operand 10656 states and 12526 transitions. Second operand 3 states. [2018-11-06 21:02:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:47,736 INFO L93 Difference]: Finished difference Result 23532 states and 27910 transitions. [2018-11-06 21:02:47,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:02:47,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-11-06 21:02:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:47,761 INFO L225 Difference]: With dead ends: 23532 [2018-11-06 21:02:47,761 INFO L226 Difference]: Without dead ends: 13063 [2018-11-06 21:02:47,772 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 21:02:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2018-11-06 21:02:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 12690. [2018-11-06 21:02:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12690 states. [2018-11-06 21:02:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12690 states to 12690 states and 14657 transitions. [2018-11-06 21:02:47,926 INFO L78 Accepts]: Start accepts. Automaton has 12690 states and 14657 transitions. Word has length 347 [2018-11-06 21:02:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:47,927 INFO L480 AbstractCegarLoop]: Abstraction has 12690 states and 14657 transitions. [2018-11-06 21:02:47,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:02:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 12690 states and 14657 transitions. [2018-11-06 21:02:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-11-06 21:02:47,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:47,950 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-11-06 21:02:47,950 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:47,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:47,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1873371516, now seen corresponding path program 1 times [2018-11-06 21:02:47,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:47,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:47,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:47,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:47,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-06 21:02:48,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:48,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:48,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:02:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:02:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:02:48,359 INFO L87 Difference]: Start difference. First operand 12690 states and 14657 transitions. Second operand 3 states. [2018-11-06 21:02:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:50,495 INFO L93 Difference]: Finished difference Result 27782 states and 32238 transitions. [2018-11-06 21:02:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:02:50,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2018-11-06 21:02:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:50,520 INFO L225 Difference]: With dead ends: 27782 [2018-11-06 21:02:50,520 INFO L226 Difference]: Without dead ends: 14535 [2018-11-06 21:02:50,533 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 21:02:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14535 states. [2018-11-06 21:02:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14535 to 13795. [2018-11-06 21:02:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13795 states. [2018-11-06 21:02:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13795 states to 13795 states and 15682 transitions. [2018-11-06 21:02:50,699 INFO L78 Accepts]: Start accepts. Automaton has 13795 states and 15682 transitions. Word has length 400 [2018-11-06 21:02:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:50,700 INFO L480 AbstractCegarLoop]: Abstraction has 13795 states and 15682 transitions. [2018-11-06 21:02:50,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:02:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13795 states and 15682 transitions. [2018-11-06 21:02:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-06 21:02:50,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:50,726 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-11-06 21:02:50,726 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:50,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash 838140476, now seen corresponding path program 1 times [2018-11-06 21:02:50,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:50,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:50,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:50,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:50,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 331 proven. 103 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-06 21:02:51,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:51,155 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 21:02:51,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:51,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 331 proven. 103 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-06 21:02:51,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:51,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-06 21:02:51,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:51,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:51,715 INFO L87 Difference]: Start difference. First operand 13795 states and 15682 transitions. Second operand 5 states. [2018-11-06 21:02:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:56,875 INFO L93 Difference]: Finished difference Result 33722 states and 38667 transitions. [2018-11-06 21:02:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:02:56,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-11-06 21:02:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:56,901 INFO L225 Difference]: With dead ends: 33722 [2018-11-06 21:02:56,901 INFO L226 Difference]: Without dead ends: 20114 [2018-11-06 21:02:56,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:02:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20114 states. [2018-11-06 21:02:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20114 to 14159. [2018-11-06 21:02:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14159 states. [2018-11-06 21:02:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14159 states to 14159 states and 16088 transitions. [2018-11-06 21:02:57,146 INFO L78 Accepts]: Start accepts. Automaton has 14159 states and 16088 transitions. Word has length 405 [2018-11-06 21:02:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:57,146 INFO L480 AbstractCegarLoop]: Abstraction has 14159 states and 16088 transitions. [2018-11-06 21:02:57,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 14159 states and 16088 transitions. [2018-11-06 21:02:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-06 21:02:57,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:57,172 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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 21:02:57,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:57,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 494281356, now seen corresponding path program 1 times [2018-11-06 21:02:57,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:57,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-06 21:02:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:57,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:57,875 INFO L87 Difference]: Start difference. First operand 14159 states and 16088 transitions. Second operand 5 states. [2018-11-06 21:03:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:00,910 INFO L93 Difference]: Finished difference Result 35358 states and 40264 transitions. [2018-11-06 21:03:00,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:03:00,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 414 [2018-11-06 21:03:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:00,929 INFO L225 Difference]: With dead ends: 35358 [2018-11-06 21:03:00,929 INFO L226 Difference]: Without dead ends: 20646 [2018-11-06 21:03:00,939 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 21:03:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20646 states. [2018-11-06 21:03:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20646 to 19166. [2018-11-06 21:03:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19166 states. [2018-11-06 21:03:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19166 states to 19166 states and 21810 transitions. [2018-11-06 21:03:01,209 INFO L78 Accepts]: Start accepts. Automaton has 19166 states and 21810 transitions. Word has length 414 [2018-11-06 21:03:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:01,209 INFO L480 AbstractCegarLoop]: Abstraction has 19166 states and 21810 transitions. [2018-11-06 21:03:01,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:03:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19166 states and 21810 transitions. [2018-11-06 21:03:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-06 21:03:01,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:01,258 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 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, 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] [2018-11-06 21:03:01,258 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:01,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1286239209, now seen corresponding path program 1 times [2018-11-06 21:03:01,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:01,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:01,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-06 21:03:01,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:01,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:03:01,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:03:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:03:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:01,803 INFO L87 Difference]: Start difference. First operand 19166 states and 21810 transitions. Second operand 3 states. [2018-11-06 21:03:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:02,705 INFO L93 Difference]: Finished difference Result 35175 states and 40002 transitions. [2018-11-06 21:03:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:02,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-11-06 21:03:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:02,724 INFO L225 Difference]: With dead ends: 35175 [2018-11-06 21:03:02,724 INFO L226 Difference]: Without dead ends: 18421 [2018-11-06 21:03:02,735 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 21:03:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2018-11-06 21:03:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 18421. [2018-11-06 21:03:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18421 states. [2018-11-06 21:03:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18421 states to 18421 states and 20880 transitions. [2018-11-06 21:03:02,952 INFO L78 Accepts]: Start accepts. Automaton has 18421 states and 20880 transitions. Word has length 440 [2018-11-06 21:03:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:02,953 INFO L480 AbstractCegarLoop]: Abstraction has 18421 states and 20880 transitions. [2018-11-06 21:03:02,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:03:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18421 states and 20880 transitions. [2018-11-06 21:03:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-06 21:03:02,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:02,972 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:03:02,972 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:02,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:02,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2047885097, now seen corresponding path program 1 times [2018-11-06 21:03:02,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:02,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:02,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:03,653 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:03:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-06 21:03:03,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:03,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:03,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:03,813 INFO L87 Difference]: Start difference. First operand 18421 states and 20880 transitions. Second operand 4 states. [2018-11-06 21:03:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:05,887 INFO L93 Difference]: Finished difference Result 37225 states and 42209 transitions. [2018-11-06 21:03:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:05,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-11-06 21:03:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:05,907 INFO L225 Difference]: With dead ends: 37225 [2018-11-06 21:03:05,907 INFO L226 Difference]: Without dead ends: 18991 [2018-11-06 21:03:05,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18991 states. [2018-11-06 21:03:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18991 to 18419. [2018-11-06 21:03:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18419 states. [2018-11-06 21:03:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18419 states to 18419 states and 20442 transitions. [2018-11-06 21:03:06,130 INFO L78 Accepts]: Start accepts. Automaton has 18419 states and 20442 transitions. Word has length 505 [2018-11-06 21:03:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:06,131 INFO L480 AbstractCegarLoop]: Abstraction has 18419 states and 20442 transitions. [2018-11-06 21:03:06,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18419 states and 20442 transitions. [2018-11-06 21:03:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-11-06 21:03:06,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:06,153 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 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] [2018-11-06 21:03:06,154 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:06,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1718702583, now seen corresponding path program 1 times [2018-11-06 21:03:06,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:06,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:06,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 454 proven. 111 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-11-06 21:03:07,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:07,592 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 21:03:07,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:07,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 348 proven. 457 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-06 21:03:08,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:08,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-06 21:03:08,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:03:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:03:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:03:08,972 INFO L87 Difference]: Start difference. First operand 18419 states and 20442 transitions. Second operand 9 states. [2018-11-06 21:03:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:18,239 INFO L93 Difference]: Finished difference Result 49532 states and 54970 transitions. [2018-11-06 21:03:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 21:03:18,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 576 [2018-11-06 21:03:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:18,269 INFO L225 Difference]: With dead ends: 49532 [2018-11-06 21:03:18,270 INFO L226 Difference]: Without dead ends: 30556 [2018-11-06 21:03:18,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-11-06 21:03:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2018-11-06 21:03:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 28049. [2018-11-06 21:03:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28049 states. [2018-11-06 21:03:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28049 states to 28049 states and 31182 transitions. [2018-11-06 21:03:18,651 INFO L78 Accepts]: Start accepts. Automaton has 28049 states and 31182 transitions. Word has length 576 [2018-11-06 21:03:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:18,651 INFO L480 AbstractCegarLoop]: Abstraction has 28049 states and 31182 transitions. [2018-11-06 21:03:18,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:03:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28049 states and 31182 transitions. [2018-11-06 21:03:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-11-06 21:03:18,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:18,673 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-11-06 21:03:18,673 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:18,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash 507591029, now seen corresponding path program 1 times [2018-11-06 21:03:18,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:18,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:18,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:18,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:18,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-11-06 21:03:19,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:19,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:03:19,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:03:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:03:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:19,117 INFO L87 Difference]: Start difference. First operand 28049 states and 31182 transitions. Second operand 3 states. [2018-11-06 21:03:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:20,587 INFO L93 Difference]: Finished difference Result 57201 states and 63569 transitions. [2018-11-06 21:03:20,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:20,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 588 [2018-11-06 21:03:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:20,615 INFO L225 Difference]: With dead ends: 57201 [2018-11-06 21:03:20,615 INFO L226 Difference]: Without dead ends: 27284 [2018-11-06 21:03:20,630 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 21:03:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27284 states. [2018-11-06 21:03:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27284 to 27099. [2018-11-06 21:03:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27099 states. [2018-11-06 21:03:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27099 states to 27099 states and 29577 transitions. [2018-11-06 21:03:20,967 INFO L78 Accepts]: Start accepts. Automaton has 27099 states and 29577 transitions. Word has length 588 [2018-11-06 21:03:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:20,968 INFO L480 AbstractCegarLoop]: Abstraction has 27099 states and 29577 transitions. [2018-11-06 21:03:20,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:03:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27099 states and 29577 transitions. [2018-11-06 21:03:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-11-06 21:03:20,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:20,996 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-11-06 21:03:20,997 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -991108154, now seen corresponding path program 1 times [2018-11-06 21:03:20,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:21,881 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-06 21:03:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 595 proven. 368 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-11-06 21:03:22,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:22,810 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:22,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:22,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 653 proven. 24 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-11-06 21:03:24,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:24,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-06 21:03:24,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:03:24,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:03:24,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:03:24,186 INFO L87 Difference]: Start difference. First operand 27099 states and 29577 transitions. Second operand 10 states. [2018-11-06 21:03:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:28,705 INFO L93 Difference]: Finished difference Result 52820 states and 57592 transitions. [2018-11-06 21:03:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:03:28,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 596 [2018-11-06 21:03:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:28,729 INFO L225 Difference]: With dead ends: 52820 [2018-11-06 21:03:28,730 INFO L226 Difference]: Without dead ends: 27760 [2018-11-06 21:03:28,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 594 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:03:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27760 states. [2018-11-06 21:03:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27760 to 27099. [2018-11-06 21:03:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27099 states. [2018-11-06 21:03:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27099 states to 27099 states and 29571 transitions. [2018-11-06 21:03:28,990 INFO L78 Accepts]: Start accepts. Automaton has 27099 states and 29571 transitions. Word has length 596 [2018-11-06 21:03:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:28,991 INFO L480 AbstractCegarLoop]: Abstraction has 27099 states and 29571 transitions. [2018-11-06 21:03:28,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:03:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 27099 states and 29571 transitions. [2018-11-06 21:03:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-11-06 21:03:29,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:29,017 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 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 21:03:29,017 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:29,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1927532272, now seen corresponding path program 1 times [2018-11-06 21:03:29,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:29,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:29,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:29,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:29,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1090 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2018-11-06 21:03:29,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:29,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:29,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:03:29,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:03:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:29,789 INFO L87 Difference]: Start difference. First operand 27099 states and 29571 transitions. Second operand 5 states. [2018-11-06 21:03:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:32,198 INFO L93 Difference]: Finished difference Result 53646 states and 58631 transitions. [2018-11-06 21:03:32,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:03:32,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 799 [2018-11-06 21:03:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:32,224 INFO L225 Difference]: With dead ends: 53646 [2018-11-06 21:03:32,224 INFO L226 Difference]: Without dead ends: 26734 [2018-11-06 21:03:32,234 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 21:03:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26734 states. [2018-11-06 21:03:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26734 to 23763. [2018-11-06 21:03:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23763 states. [2018-11-06 21:03:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23763 states to 23763 states and 25456 transitions. [2018-11-06 21:03:32,464 INFO L78 Accepts]: Start accepts. Automaton has 23763 states and 25456 transitions. Word has length 799 [2018-11-06 21:03:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:32,465 INFO L480 AbstractCegarLoop]: Abstraction has 23763 states and 25456 transitions. [2018-11-06 21:03:32,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:03:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23763 states and 25456 transitions. [2018-11-06 21:03:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2018-11-06 21:03:32,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:32,484 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-06 21:03:32,484 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:32,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1966311317, now seen corresponding path program 1 times [2018-11-06 21:03:32,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:32,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:32,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:32,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:33,115 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:03:33,610 WARN L179 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-11-06 21:03:34,038 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-11-06 21:03:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2497 backedges. 1145 proven. 112 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-06 21:03:35,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:35,260 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:35,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:39,161 WARN L179 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-06 21:03:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2497 backedges. 1498 proven. 409 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2018-11-06 21:03:41,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:41,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-11-06 21:03:41,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:03:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:03:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:03:41,958 INFO L87 Difference]: Start difference. First operand 23763 states and 25456 transitions. Second operand 13 states. [2018-11-06 21:03:56,244 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 48 Received shutdown request... [2018-11-06 21:06:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-06 21:06:24,265 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:06:24,270 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:06:24,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:24 BoogieIcfgContainer [2018-11-06 21:06:24,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:24,271 INFO L168 Benchmark]: Toolchain (without parser) took 247845.05 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:24,273 INFO L168 Benchmark]: CDTParser took 0.21 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 21:06:24,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 940.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:24,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 295.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:24,276 INFO L168 Benchmark]: Boogie Preprocessor took 140.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:24,277 INFO L168 Benchmark]: RCFGBuilder took 4725.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 180.7 MB). Peak memory consumption was 180.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:24,278 INFO L168 Benchmark]: TraceAbstraction took 241738.58 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -664.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:24,290 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.21 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 940.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 295.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4725.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 180.7 MB). Peak memory consumption was 180.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241738.58 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -664.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 189]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 189). Cancelled while BasicCegarLoop was constructing difference of abstraction (23763states) and FLOYD_HOARE automaton (currently 42 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (55438 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 241.6s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 214.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4023 SDtfs, 11772 SDslu, 2237 SDs, 0 SdLazy, 28166 SolverSat, 5015 SolverUnsat, 68 SolverUnknown, 0 SolverNotchecked, 196.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2576 GetRequests, 2458 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28049occurred in iteration=14, 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: 3.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 17378 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 9846 NumberOfCodeBlocks, 9846 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9824 ConstructedInterpolants, 452 QuantifiedInterpolants, 32133013 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3145 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 15687/17374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown