java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label30_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:11:22,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:11:22,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:11:22,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:11:22,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:11:22,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:11:22,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:11:22,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:11:22,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:11:22,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:11:22,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:11:22,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:11:22,525 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:11:22,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:11:22,527 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:11:22,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:11:22,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:11:22,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:11:22,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:11:22,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:11:22,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:11:22,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:11:22,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:11:22,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:11:22,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:11:22,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:11:22,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:11:22,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:11:22,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:11:22,562 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:11:22,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:11:22,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:11:22,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:11:22,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:11:22,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:11:22,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:11:22,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:11:22,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:11:22,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:11:22,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:11:22,594 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:11:22,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:11:22,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:11:22,595 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:11:22,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:11:22,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:11:22,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:11:22,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:11:22,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:11:22,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:11:22,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:11:22,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:11:22,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:11:22,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:11:22,598 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:11:22,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:11:22,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:11:22,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:11:22,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:11:22,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:11:22,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:11:22,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:11:22,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:11:22,600 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:11:22,600 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:11:22,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:11:22,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:11:22,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:11:22,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:11:22,685 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:11:22,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label30_false-unreach-call.c [2018-11-06 19:11:22,745 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e491645a3/bac95c2c863b4e829b8110d381557c8a/FLAG6fd85e9af [2018-11-06 19:11:23,556 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:11:23,557 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label30_false-unreach-call.c [2018-11-06 19:11:23,604 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e491645a3/bac95c2c863b4e829b8110d381557c8a/FLAG6fd85e9af [2018-11-06 19:11:23,627 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e491645a3/bac95c2c863b4e829b8110d381557c8a [2018-11-06 19:11:23,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:11:23,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:11:23,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:11:23,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:11:23,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:11:23,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:11:23" (1/1) ... [2018-11-06 19:11:23,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673adebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:23, skipping insertion in model container [2018-11-06 19:11:23,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:11:23" (1/1) ... [2018-11-06 19:11:23,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:11:23,857 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:11:25,288 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:11:25,293 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:11:26,015 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:11:26,049 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:11:26,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26 WrapperNode [2018-11-06 19:11:26,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:11:26,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:11:26,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:11:26,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:11:26,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:26,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:26,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:11:26,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:11:26,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:11:26,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:11:26,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:26,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:26,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:26,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:27,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:27,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:27,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... [2018-11-06 19:11:27,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:11:27,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:11:27,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:11:27,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:11:27,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:11:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:11:27,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:11:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:11:37,552 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:11:37,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:11:37 BoogieIcfgContainer [2018-11-06 19:11:37,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:11:37,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:11:37,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:11:37,558 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:11:37,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:11:23" (1/3) ... [2018-11-06 19:11:37,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50010302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:11:37, skipping insertion in model container [2018-11-06 19:11:37,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:26" (2/3) ... [2018-11-06 19:11:37,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50010302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:11:37, skipping insertion in model container [2018-11-06 19:11:37,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:11:37" (3/3) ... [2018-11-06 19:11:37,562 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label30_false-unreach-call.c [2018-11-06 19:11:37,574 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:11:37,587 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:11:37,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:11:37,660 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:11:37,661 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:11:37,661 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:11:37,661 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:11:37,661 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:11:37,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:11:37,661 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:11:37,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:11:37,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:11:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:11:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-06 19:11:37,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:37,710 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] [2018-11-06 19:11:37,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:37,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash 183950178, now seen corresponding path program 1 times [2018-11-06 19:11:37,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:37,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:37,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:37,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:38,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:38,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:38,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:38,193 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 19:11:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:51,893 INFO L93 Difference]: Finished difference Result 3879 states and 7287 transitions. [2018-11-06 19:11:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:51,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-06 19:11:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:51,945 INFO L225 Difference]: With dead ends: 3879 [2018-11-06 19:11:51,945 INFO L226 Difference]: Without dead ends: 2773 [2018-11-06 19:11:51,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2018-11-06 19:11:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2742. [2018-11-06 19:11:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2742 states. [2018-11-06 19:11:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4466 transitions. [2018-11-06 19:11:52,115 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4466 transitions. Word has length 20 [2018-11-06 19:11:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:52,116 INFO L480 AbstractCegarLoop]: Abstraction has 2742 states and 4466 transitions. [2018-11-06 19:11:52,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4466 transitions. [2018-11-06 19:11:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-06 19:11:52,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:52,121 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:52,122 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:52,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash 300544526, now seen corresponding path program 1 times [2018-11-06 19:11:52,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:52,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-06 19:11:52,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:11:52,453 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:11:52,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:52,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:11:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:52,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:11:52,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 19:11:52,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:52,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:52,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:52,611 INFO L87 Difference]: Start difference. First operand 2742 states and 4466 transitions. Second operand 4 states. [2018-11-06 19:12:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:05,887 INFO L93 Difference]: Finished difference Result 10279 states and 16957 transitions. [2018-11-06 19:12:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:05,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-06 19:12:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:05,927 INFO L225 Difference]: With dead ends: 10279 [2018-11-06 19:12:05,928 INFO L226 Difference]: Without dead ends: 7539 [2018-11-06 19:12:05,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2018-11-06 19:12:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 5128. [2018-11-06 19:12:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5128 states. [2018-11-06 19:12:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 8009 transitions. [2018-11-06 19:12:06,058 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 8009 transitions. Word has length 110 [2018-11-06 19:12:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:06,059 INFO L480 AbstractCegarLoop]: Abstraction has 5128 states and 8009 transitions. [2018-11-06 19:12:06,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 8009 transitions. [2018-11-06 19:12:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-06 19:12:06,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:06,075 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:06,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:06,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1029685430, now seen corresponding path program 1 times [2018-11-06 19:12:06,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:06,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:06,601 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-06 19:12:06,780 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 4 [2018-11-06 19:12:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:12:07,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:07,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:07,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:07,006 INFO L87 Difference]: Start difference. First operand 5128 states and 8009 transitions. Second operand 5 states. [2018-11-06 19:12:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:17,997 INFO L93 Difference]: Finished difference Result 16563 states and 25362 transitions. [2018-11-06 19:12:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:17,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-06 19:12:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:18,045 INFO L225 Difference]: With dead ends: 16563 [2018-11-06 19:12:18,045 INFO L226 Difference]: Without dead ends: 11437 [2018-11-06 19:12:18,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:12:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11437 states. [2018-11-06 19:12:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11437 to 11436. [2018-11-06 19:12:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11436 states. [2018-11-06 19:12:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 15909 transitions. [2018-11-06 19:12:18,264 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 15909 transitions. Word has length 159 [2018-11-06 19:12:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:18,264 INFO L480 AbstractCegarLoop]: Abstraction has 11436 states and 15909 transitions. [2018-11-06 19:12:18,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 15909 transitions. [2018-11-06 19:12:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-06 19:12:18,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:18,269 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:18,270 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:18,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1977042759, now seen corresponding path program 1 times [2018-11-06 19:12:18,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:18,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:18,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:18,631 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 19:12:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 35 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 19:12:18,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:12:18,660 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:12:18,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:18,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:12:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:12:18,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:12:18,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-11-06 19:12:18,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:18,843 INFO L87 Difference]: Start difference. First operand 11436 states and 15909 transitions. Second operand 5 states. [2018-11-06 19:12:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:31,173 INFO L93 Difference]: Finished difference Result 43401 states and 61089 transitions. [2018-11-06 19:12:31,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:31,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-11-06 19:12:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:31,272 INFO L225 Difference]: With dead ends: 43401 [2018-11-06 19:12:31,273 INFO L226 Difference]: Without dead ends: 32755 [2018-11-06 19:12:31,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32755 states. [2018-11-06 19:12:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32755 to 25621. [2018-11-06 19:12:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25621 states. [2018-11-06 19:12:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25621 states to 25621 states and 33098 transitions. [2018-11-06 19:12:31,700 INFO L78 Accepts]: Start accepts. Automaton has 25621 states and 33098 transitions. Word has length 185 [2018-11-06 19:12:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:31,701 INFO L480 AbstractCegarLoop]: Abstraction has 25621 states and 33098 transitions. [2018-11-06 19:12:31,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25621 states and 33098 transitions. [2018-11-06 19:12:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-06 19:12:31,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:31,705 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:31,705 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:31,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2063229366, now seen corresponding path program 1 times [2018-11-06 19:12:31,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:31,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:31,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:31,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:31,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 19:12:31,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:31,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:12:31,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:12:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:12:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:31,963 INFO L87 Difference]: Start difference. First operand 25621 states and 33098 transitions. Second operand 3 states. [2018-11-06 19:12:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:38,570 INFO L93 Difference]: Finished difference Result 73301 states and 95285 transitions. [2018-11-06 19:12:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:12:38,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-11-06 19:12:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:38,672 INFO L225 Difference]: With dead ends: 73301 [2018-11-06 19:12:38,672 INFO L226 Difference]: Without dead ends: 48470 [2018-11-06 19:12:38,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48470 states. [2018-11-06 19:12:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48470 to 48469. [2018-11-06 19:12:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48469 states. [2018-11-06 19:12:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48469 states to 48469 states and 58804 transitions. [2018-11-06 19:12:39,337 INFO L78 Accepts]: Start accepts. Automaton has 48469 states and 58804 transitions. Word has length 196 [2018-11-06 19:12:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:39,338 INFO L480 AbstractCegarLoop]: Abstraction has 48469 states and 58804 transitions. [2018-11-06 19:12:39,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:12:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 48469 states and 58804 transitions. [2018-11-06 19:12:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-06 19:12:39,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:39,347 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:12:39,347 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:39,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:39,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1663665131, now seen corresponding path program 1 times [2018-11-06 19:12:39,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:40,023 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-11-06 19:12:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 192 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-06 19:12:40,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:12:40,168 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 19:12:40,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:40,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:12:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:12:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:12:40,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 19:12:40,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:40,457 INFO L87 Difference]: Start difference. First operand 48469 states and 58804 transitions. Second operand 4 states. [2018-11-06 19:12:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:49,184 INFO L93 Difference]: Finished difference Result 114312 states and 136549 transitions. [2018-11-06 19:12:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:49,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2018-11-06 19:12:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:49,328 INFO L225 Difference]: With dead ends: 114312 [2018-11-06 19:12:49,328 INFO L226 Difference]: Without dead ends: 66633 [2018-11-06 19:12:49,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 313 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 19:12:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66633 states. [2018-11-06 19:12:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66633 to 57138. [2018-11-06 19:12:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57138 states. [2018-11-06 19:12:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57138 states to 57138 states and 68104 transitions. [2018-11-06 19:12:50,115 INFO L78 Accepts]: Start accepts. Automaton has 57138 states and 68104 transitions. Word has length 313 [2018-11-06 19:12:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:50,116 INFO L480 AbstractCegarLoop]: Abstraction has 57138 states and 68104 transitions. [2018-11-06 19:12:50,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57138 states and 68104 transitions. [2018-11-06 19:12:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-06 19:12:50,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:50,126 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:50,126 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:50,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -878020386, now seen corresponding path program 1 times [2018-11-06 19:12:50,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:12:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:50,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:12:50,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:50,520 INFO L87 Difference]: Start difference. First operand 57138 states and 68104 transitions. Second operand 4 states. [2018-11-06 19:12:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:58,424 INFO L93 Difference]: Finished difference Result 122940 states and 146167 transitions. [2018-11-06 19:12:58,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:58,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-11-06 19:12:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:58,538 INFO L225 Difference]: With dead ends: 122940 [2018-11-06 19:12:58,539 INFO L226 Difference]: Without dead ends: 57862 [2018-11-06 19:12:59,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2018-11-06 19:12:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 50769. [2018-11-06 19:12:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2018-11-06 19:12:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 59099 transitions. [2018-11-06 19:12:59,779 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 59099 transitions. Word has length 342 [2018-11-06 19:12:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:59,780 INFO L480 AbstractCegarLoop]: Abstraction has 50769 states and 59099 transitions. [2018-11-06 19:12:59,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 59099 transitions. [2018-11-06 19:12:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-06 19:12:59,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:59,789 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:59,789 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:59,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 673085932, now seen corresponding path program 1 times [2018-11-06 19:12:59,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:59,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:59,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:59,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:59,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:13:00,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:00,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:00,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:00,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:00,181 INFO L87 Difference]: Start difference. First operand 50769 states and 59099 transitions. Second operand 4 states. [2018-11-06 19:13:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:11,423 INFO L93 Difference]: Finished difference Result 130717 states and 153407 transitions. [2018-11-06 19:13:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:11,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2018-11-06 19:13:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:11,538 INFO L225 Difference]: With dead ends: 130717 [2018-11-06 19:13:11,538 INFO L226 Difference]: Without dead ends: 80738 [2018-11-06 19:13:11,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80738 states. [2018-11-06 19:13:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80738 to 78349. [2018-11-06 19:13:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78349 states. [2018-11-06 19:13:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78349 states to 78349 states and 89264 transitions. [2018-11-06 19:13:13,184 INFO L78 Accepts]: Start accepts. Automaton has 78349 states and 89264 transitions. Word has length 362 [2018-11-06 19:13:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:13,185 INFO L480 AbstractCegarLoop]: Abstraction has 78349 states and 89264 transitions. [2018-11-06 19:13:13,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 78349 states and 89264 transitions. [2018-11-06 19:13:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-06 19:13:13,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:13,195 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:13,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:13,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:13,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1646142113, now seen corresponding path program 1 times [2018-11-06 19:13:13,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:13,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:13,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:13,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:13,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:13:13,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:13,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:13,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:13:13,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:13:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:13:13,723 INFO L87 Difference]: Start difference. First operand 78349 states and 89264 transitions. Second operand 5 states. [2018-11-06 19:13:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:33,125 INFO L93 Difference]: Finished difference Result 283823 states and 322965 transitions. [2018-11-06 19:13:33,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:13:33,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 377 [2018-11-06 19:13:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:33,411 INFO L225 Difference]: With dead ends: 283823 [2018-11-06 19:13:33,411 INFO L226 Difference]: Without dead ends: 206261 [2018-11-06 19:13:33,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:13:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206261 states. [2018-11-06 19:13:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206261 to 195057. [2018-11-06 19:13:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195057 states. [2018-11-06 19:13:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195057 states to 195057 states and 217964 transitions. [2018-11-06 19:13:35,241 INFO L78 Accepts]: Start accepts. Automaton has 195057 states and 217964 transitions. Word has length 377 [2018-11-06 19:13:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:35,241 INFO L480 AbstractCegarLoop]: Abstraction has 195057 states and 217964 transitions. [2018-11-06 19:13:35,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:13:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 195057 states and 217964 transitions. [2018-11-06 19:13:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-06 19:13:35,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:35,253 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:35,253 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:35,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash -816251699, now seen corresponding path program 1 times [2018-11-06 19:13:35,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 709 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-11-06 19:13:36,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:36,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:36,956 INFO L87 Difference]: Start difference. First operand 195057 states and 217964 transitions. Second operand 4 states. [2018-11-06 19:13:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:46,373 INFO L93 Difference]: Finished difference Result 386998 states and 432647 transitions. [2018-11-06 19:13:46,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:46,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2018-11-06 19:13:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:46,640 INFO L225 Difference]: With dead ends: 386998 [2018-11-06 19:13:46,640 INFO L226 Difference]: Without dead ends: 192731 [2018-11-06 19:13:47,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192731 states. [2018-11-06 19:13:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192731 to 191112. [2018-11-06 19:13:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191112 states. [2018-11-06 19:13:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191112 states to 191112 states and 207035 transitions. [2018-11-06 19:13:49,640 INFO L78 Accepts]: Start accepts. Automaton has 191112 states and 207035 transitions. Word has length 467 [2018-11-06 19:13:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:49,641 INFO L480 AbstractCegarLoop]: Abstraction has 191112 states and 207035 transitions. [2018-11-06 19:13:49,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 191112 states and 207035 transitions. [2018-11-06 19:13:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-11-06 19:13:49,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:49,650 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:49,650 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:49,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 752697744, now seen corresponding path program 1 times [2018-11-06 19:13:49,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:49,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-06 19:13:50,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:50,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:50,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:50,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:50,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:50,023 INFO L87 Difference]: Start difference. First operand 191112 states and 207035 transitions. Second operand 4 states. [2018-11-06 19:14:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:03,116 INFO L93 Difference]: Finished difference Result 428079 states and 464273 transitions. [2018-11-06 19:14:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:03,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 478 [2018-11-06 19:14:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:03,388 INFO L225 Difference]: With dead ends: 428079 [2018-11-06 19:14:03,389 INFO L226 Difference]: Without dead ends: 237757 [2018-11-06 19:14:03,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237757 states. [2018-11-06 19:14:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237757 to 236050. [2018-11-06 19:14:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236050 states. [2018-11-06 19:14:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236050 states to 236050 states and 255256 transitions. [2018-11-06 19:14:11,658 INFO L78 Accepts]: Start accepts. Automaton has 236050 states and 255256 transitions. Word has length 478 [2018-11-06 19:14:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:11,659 INFO L480 AbstractCegarLoop]: Abstraction has 236050 states and 255256 transitions. [2018-11-06 19:14:11,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 236050 states and 255256 transitions. [2018-11-06 19:14:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-11-06 19:14:11,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:11,670 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:11,670 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:11,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1854620957, now seen corresponding path program 1 times [2018-11-06 19:14:11,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:11,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 369 proven. 18 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 19:14:12,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:14:12,516 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 19:14:12,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:12,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:14:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-06 19:14:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:14:13,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-06 19:14:13,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:14:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:14:13,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:14:13,603 INFO L87 Difference]: Start difference. First operand 236050 states and 255256 transitions. Second operand 8 states. [2018-11-06 19:14:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:27,164 INFO L93 Difference]: Finished difference Result 459601 states and 497767 transitions. [2018-11-06 19:14:27,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:14:27,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 578 [2018-11-06 19:14:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:27,487 INFO L225 Difference]: With dead ends: 459601 [2018-11-06 19:14:27,487 INFO L226 Difference]: Without dead ends: 224341 [2018-11-06 19:14:27,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 580 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:14:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224341 states. [2018-11-06 19:14:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224341 to 217872. [2018-11-06 19:14:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217872 states. [2018-11-06 19:14:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217872 states to 217872 states and 229830 transitions. [2018-11-06 19:14:30,643 INFO L78 Accepts]: Start accepts. Automaton has 217872 states and 229830 transitions. Word has length 578 [2018-11-06 19:14:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:30,645 INFO L480 AbstractCegarLoop]: Abstraction has 217872 states and 229830 transitions. [2018-11-06 19:14:30,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:14:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 217872 states and 229830 transitions. [2018-11-06 19:14:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2018-11-06 19:14:30,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:30,696 INFO L375 BasicCegarLoop]: trace histogram [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, 7, 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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:14:30,696 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:30,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1872031008, now seen corresponding path program 1 times [2018-11-06 19:14:30,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:30,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:30,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2073 backedges. 1162 proven. 0 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2018-11-06 19:14:32,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:32,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:14:32,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:14:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:14:32,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:14:32,497 INFO L87 Difference]: Start difference. First operand 217872 states and 229830 transitions. Second operand 3 states. [2018-11-06 19:14:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:37,121 INFO L93 Difference]: Finished difference Result 434152 states and 457954 transitions. [2018-11-06 19:14:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:14:37,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 910 [2018-11-06 19:14:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:37,354 INFO L225 Difference]: With dead ends: 434152 [2018-11-06 19:14:37,354 INFO L226 Difference]: Without dead ends: 217068 [2018-11-06 19:14:37,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:14:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217068 states. [2018-11-06 19:14:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217068 to 217068. [2018-11-06 19:14:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217068 states. [2018-11-06 19:14:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217068 states to 217068 states and 228893 transitions. [2018-11-06 19:14:40,196 INFO L78 Accepts]: Start accepts. Automaton has 217068 states and 228893 transitions. Word has length 910 [2018-11-06 19:14:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:40,197 INFO L480 AbstractCegarLoop]: Abstraction has 217068 states and 228893 transitions. [2018-11-06 19:14:40,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:14:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 217068 states and 228893 transitions. [2018-11-06 19:14:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2018-11-06 19:14:40,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:40,246 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:40,246 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:40,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 958306381, now seen corresponding path program 1 times [2018-11-06 19:14:40,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-11-06 19:14:41,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:41,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:41,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:41,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:41,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:41,982 INFO L87 Difference]: Start difference. First operand 217068 states and 228893 transitions. Second operand 4 states. [2018-11-06 19:14:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:50,317 INFO L93 Difference]: Finished difference Result 433362 states and 456989 transitions. [2018-11-06 19:14:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:50,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 911 [2018-11-06 19:14:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:51,318 INFO L225 Difference]: With dead ends: 433362 [2018-11-06 19:14:51,318 INFO L226 Difference]: Without dead ends: 217084 [2018-11-06 19:14:51,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217084 states. [2018-11-06 19:14:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217084 to 209971. [2018-11-06 19:14:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209971 states. [2018-11-06 19:14:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209971 states to 209971 states and 219196 transitions. [2018-11-06 19:14:53,402 INFO L78 Accepts]: Start accepts. Automaton has 209971 states and 219196 transitions. Word has length 911 [2018-11-06 19:14:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:53,403 INFO L480 AbstractCegarLoop]: Abstraction has 209971 states and 219196 transitions. [2018-11-06 19:14:53,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 209971 states and 219196 transitions. [2018-11-06 19:14:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2018-11-06 19:14:53,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:53,445 INFO L375 BasicCegarLoop]: trace histogram [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, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:14:53,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:53,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 817114461, now seen corresponding path program 1 times [2018-11-06 19:14:53,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:53,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:53,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:53,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:53,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:54,036 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:14:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 1328 proven. 0 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2018-11-06 19:14:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:54,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:54,761 INFO L87 Difference]: Start difference. First operand 209971 states and 219196 transitions. Second operand 4 states. [2018-11-06 19:15:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:04,446 INFO L93 Difference]: Finished difference Result 416812 states and 435122 transitions. [2018-11-06 19:15:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:04,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 918 [2018-11-06 19:15:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:04,681 INFO L225 Difference]: With dead ends: 416812 [2018-11-06 19:15:04,682 INFO L226 Difference]: Without dead ends: 207631 [2018-11-06 19:15:04,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207631 states. [2018-11-06 19:15:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207631 to 197349. [2018-11-06 19:15:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197349 states. [2018-11-06 19:15:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197349 states to 197349 states and 204333 transitions. [2018-11-06 19:15:07,073 INFO L78 Accepts]: Start accepts. Automaton has 197349 states and 204333 transitions. Word has length 918 [2018-11-06 19:15:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:07,074 INFO L480 AbstractCegarLoop]: Abstraction has 197349 states and 204333 transitions. [2018-11-06 19:15:07,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 197349 states and 204333 transitions. [2018-11-06 19:15:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2018-11-06 19:15:07,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:07,105 INFO L375 BasicCegarLoop]: trace histogram [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, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:15:07,106 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:07,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1722864403, now seen corresponding path program 1 times [2018-11-06 19:15:07,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:07,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:07,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-06 19:15:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2138 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-11-06 19:15:09,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:09,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:15:09,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:09,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:09,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:09,420 INFO L87 Difference]: Start difference. First operand 197349 states and 204333 transitions. Second operand 4 states. [2018-11-06 19:15:09,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 19:15:09,421 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:15:09,427 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:15:09,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:15:09 BoogieIcfgContainer [2018-11-06 19:15:09,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:15:09,431 INFO L168 Benchmark]: Toolchain (without parser) took 225788.96 ms. Allocated memory was 1.5 GB in the beginning and 4.9 GB in the end (delta: 3.4 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 971.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,432 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 19:15:09,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2406.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 757.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,436 INFO L168 Benchmark]: Boogie Preprocessor took 469.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,436 INFO L168 Benchmark]: RCFGBuilder took 10274.37 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 245.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 586.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,439 INFO L168 Benchmark]: TraceAbstraction took 211874.87 ms. Allocated memory was 2.6 GB in the beginning and 4.9 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 579.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:15:09,448 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 2406.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 757.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 469.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10274.37 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 245.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 586.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211874.87 ms. Allocated memory was 2.6 GB in the beginning and 4.9 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 579.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (197349states) and FLOYD_HOARE automaton (currently 2 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 211.7s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 168.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10624 SDtfs, 32706 SDslu, 3936 SDs, 0 SdLazy, 75098 SolverSat, 15716 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 124.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1256 GetRequests, 1205 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236050occurred in iteration=11, 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: 26.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 66949 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 8436 NumberOfCodeBlocks, 8436 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 8416 ConstructedInterpolants, 0 QuantifiedInterpolants, 10124441 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1619 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 12766/12858 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown