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/Problem17_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:43:34,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:43:34,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:43:34,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:43:34,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:43:34,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:43:34,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:43:34,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:43:34,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:43:34,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:43:34,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:43:34,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:43:34,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:43:34,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:43:34,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:43:34,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:43:34,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:43:34,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:43:34,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:43:34,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:43:34,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:43:34,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:43:34,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:43:34,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:43:34,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:43:34,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:43:34,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:43:34,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:43:34,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:43:34,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:43:34,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:43:34,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:43:34,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:43:34,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:43:34,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:43:34,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:43:34,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:43:34,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:43:34,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:43:34,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:43:34,633 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:43:34,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:43:34,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:43:34,634 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:43:34,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:43:34,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:43:34,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:43:34,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:43:34,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:43:34,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:43:34,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:43:34,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:43:34,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:43:34,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:43:34,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:43:34,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:43:34,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:43:34,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:43:34,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:43:34,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:43:34,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:43:34,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:43:34,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:43:34,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:43:34,638 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:43:34,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:43:34,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:43:34,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:43:34,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:43:34,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:43:34,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label24_true-unreach-call.c [2018-11-06 21:43:34,757 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090148d78/4371a34952fe4a898847e40f20865fd0/FLAGea6484fc9 [2018-11-06 21:43:35,500 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:43:35,501 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label24_true-unreach-call.c [2018-11-06 21:43:35,523 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090148d78/4371a34952fe4a898847e40f20865fd0/FLAGea6484fc9 [2018-11-06 21:43:35,539 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090148d78/4371a34952fe4a898847e40f20865fd0 [2018-11-06 21:43:35,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:43:35,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:43:35,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:43:35,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:43:35,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:43:35,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:43:35" (1/1) ... [2018-11-06 21:43:35,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56927dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:35, skipping insertion in model container [2018-11-06 21:43:35,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:43:35" (1/1) ... [2018-11-06 21:43:35,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:43:35,680 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:43:36,619 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:43:36,625 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:43:37,029 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:43:37,054 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:43:37,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37 WrapperNode [2018-11-06 21:43:37,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:43:37,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:43:37,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:43:37,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:43:37,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:43:37,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:43:37,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:43:37,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:43:37,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... [2018-11-06 21:43:37,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:43:37,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:43:37,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:43:37,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:43:37,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:43:37,924 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:43:37,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:43:37,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:43:46,556 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:43:46,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:43:46 BoogieIcfgContainer [2018-11-06 21:43:46,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:43:46,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:43:46,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:43:46,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:43:46,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:43:35" (1/3) ... [2018-11-06 21:43:46,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe9a0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:43:46, skipping insertion in model container [2018-11-06 21:43:46,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:37" (2/3) ... [2018-11-06 21:43:46,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe9a0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:43:46, skipping insertion in model container [2018-11-06 21:43:46,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:43:46" (3/3) ... [2018-11-06 21:43:46,567 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label24_true-unreach-call.c [2018-11-06 21:43:46,577 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:43:46,587 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:43:46,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:43:46,647 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:43:46,648 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:43:46,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:43:46,649 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:43:46,649 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:43:46,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:43:46,649 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:43:46,649 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:43:46,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:43:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:43:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-06 21:43:46,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:46,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:43:46,694 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:46,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:46,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1059493314, now seen corresponding path program 1 times [2018-11-06 21:43:46,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:46,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:46,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:43:47,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:43:47,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:43:47,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:43:47,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:43:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:43:47,203 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:43:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:43:55,429 INFO L93 Difference]: Finished difference Result 2093 states and 3901 transitions. [2018-11-06 21:43:55,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:43:55,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-06 21:43:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:43:55,469 INFO L225 Difference]: With dead ends: 2093 [2018-11-06 21:43:55,469 INFO L226 Difference]: Without dead ends: 1495 [2018-11-06 21:43:55,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:43:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-11-06 21:43:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1488. [2018-11-06 21:43:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-11-06 21:43:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2247 transitions. [2018-11-06 21:43:55,631 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2247 transitions. Word has length 61 [2018-11-06 21:43:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:43:55,632 INFO L480 AbstractCegarLoop]: Abstraction has 1488 states and 2247 transitions. [2018-11-06 21:43:55,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:43:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2247 transitions. [2018-11-06 21:43:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 21:43:55,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:43:55,638 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:43:55,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:43:55,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:43:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash -520895210, now seen corresponding path program 1 times [2018-11-06 21:43:55,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:43:55,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:43:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:55,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:43:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:43:56,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:43:56,030 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:43:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:43:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:43:56,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:43:56,640 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 23 [2018-11-06 21:43:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:43:56,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:43:56,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:43:56,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:43:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:43:56,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:43:56,990 INFO L87 Difference]: Start difference. First operand 1488 states and 2247 transitions. Second operand 7 states. [2018-11-06 21:45:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:18,632 INFO L93 Difference]: Finished difference Result 9604 states and 15418 transitions. [2018-11-06 21:45:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:45:18,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-11-06 21:45:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:18,673 INFO L225 Difference]: With dead ends: 9604 [2018-11-06 21:45:18,673 INFO L226 Difference]: Without dead ends: 8118 [2018-11-06 21:45:18,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:45:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8118 states. [2018-11-06 21:45:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8118 to 8059. [2018-11-06 21:45:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8059 states. [2018-11-06 21:45:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8059 states to 8059 states and 10426 transitions. [2018-11-06 21:45:18,837 INFO L78 Accepts]: Start accepts. Automaton has 8059 states and 10426 transitions. Word has length 132 [2018-11-06 21:45:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:18,838 INFO L480 AbstractCegarLoop]: Abstraction has 8059 states and 10426 transitions. [2018-11-06 21:45:18,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:45:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8059 states and 10426 transitions. [2018-11-06 21:45:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 21:45:18,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:18,845 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:45:18,845 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:18,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1441119411, now seen corresponding path program 1 times [2018-11-06 21:45:18,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:18,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:45:19,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:19,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:19,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:45:19,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:45:19,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:19,054 INFO L87 Difference]: Start difference. First operand 8059 states and 10426 transitions. Second operand 4 states. [2018-11-06 21:45:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:24,774 INFO L93 Difference]: Finished difference Result 28059 states and 36859 transitions. [2018-11-06 21:45:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:45:24,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-06 21:45:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:24,861 INFO L225 Difference]: With dead ends: 28059 [2018-11-06 21:45:24,862 INFO L226 Difference]: Without dead ends: 20002 [2018-11-06 21:45:24,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 21:45:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20002 states. [2018-11-06 21:45:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20002 to 19979. [2018-11-06 21:45:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19979 states. [2018-11-06 21:45:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19979 states to 19979 states and 23938 transitions. [2018-11-06 21:45:25,252 INFO L78 Accepts]: Start accepts. Automaton has 19979 states and 23938 transitions. Word has length 154 [2018-11-06 21:45:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:25,252 INFO L480 AbstractCegarLoop]: Abstraction has 19979 states and 23938 transitions. [2018-11-06 21:45:25,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:45:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 23938 transitions. [2018-11-06 21:45:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-06 21:45:25,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:25,264 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:45:25,264 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:25,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1684584490, now seen corresponding path program 1 times [2018-11-06 21:45:25,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 21:45:25,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:25,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:45:25,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:25,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:25,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:25,751 INFO L87 Difference]: Start difference. First operand 19979 states and 23938 transitions. Second operand 3 states. [2018-11-06 21:45:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:29,181 INFO L93 Difference]: Finished difference Result 56999 states and 68643 transitions. [2018-11-06 21:45:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:29,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2018-11-06 21:45:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:29,231 INFO L225 Difference]: With dead ends: 56999 [2018-11-06 21:45:29,231 INFO L226 Difference]: Without dead ends: 25855 [2018-11-06 21:45:29,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25855 states. [2018-11-06 21:45:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25855 to 25854. [2018-11-06 21:45:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25854 states. [2018-11-06 21:45:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25854 states to 25854 states and 28846 transitions. [2018-11-06 21:45:29,679 INFO L78 Accepts]: Start accepts. Automaton has 25854 states and 28846 transitions. Word has length 281 [2018-11-06 21:45:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:29,679 INFO L480 AbstractCegarLoop]: Abstraction has 25854 states and 28846 transitions. [2018-11-06 21:45:29,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:45:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25854 states and 28846 transitions. [2018-11-06 21:45:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-06 21:45:29,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:29,688 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-06 21:45:29,688 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:29,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash -182801957, now seen corresponding path program 1 times [2018-11-06 21:45:29,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:29,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:30,180 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-06 21:45:30,412 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-06 21:45:30,671 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-06 21:45:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 195 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:45:31,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:45:31,007 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:45:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:31,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:45:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 21:45:31,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:45:31,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-06 21:45:31,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:45:31,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:45:31,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:45:31,226 INFO L87 Difference]: Start difference. First operand 25854 states and 28846 transitions. Second operand 8 states. [2018-11-06 21:45:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:40,822 INFO L93 Difference]: Finished difference Result 59497 states and 67398 transitions. [2018-11-06 21:45:40,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:45:40,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 294 [2018-11-06 21:45:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:40,879 INFO L225 Difference]: With dead ends: 59497 [2018-11-06 21:45:40,879 INFO L226 Difference]: Without dead ends: 34071 [2018-11-06 21:45:40,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:45:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34071 states. [2018-11-06 21:45:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34071 to 33941. [2018-11-06 21:45:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33941 states. [2018-11-06 21:45:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33941 states to 33941 states and 37327 transitions. [2018-11-06 21:45:41,310 INFO L78 Accepts]: Start accepts. Automaton has 33941 states and 37327 transitions. Word has length 294 [2018-11-06 21:45:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 33941 states and 37327 transitions. [2018-11-06 21:45:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:45:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 33941 states and 37327 transitions. [2018-11-06 21:45:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-11-06 21:45:41,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:41,325 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:45:41,325 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:41,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:41,325 INFO L82 PathProgramCache]: Analyzing trace with hash -38267715, now seen corresponding path program 1 times [2018-11-06 21:45:41,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:41,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:41,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 21:45:41,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:45:41,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:45:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:45:41,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:41,813 INFO L87 Difference]: Start difference. First operand 33941 states and 37327 transitions. Second operand 4 states. [2018-11-06 21:45:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:48,289 INFO L93 Difference]: Finished difference Result 90530 states and 100030 transitions. [2018-11-06 21:45:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:45:48,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2018-11-06 21:45:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:48,390 INFO L225 Difference]: With dead ends: 90530 [2018-11-06 21:45:48,391 INFO L226 Difference]: Without dead ends: 57018 [2018-11-06 21:45:48,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57018 states. [2018-11-06 21:45:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57018 to 54424. [2018-11-06 21:45:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54424 states. [2018-11-06 21:45:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54424 states to 54424 states and 59432 transitions. [2018-11-06 21:45:49,054 INFO L78 Accepts]: Start accepts. Automaton has 54424 states and 59432 transitions. Word has length 376 [2018-11-06 21:45:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:49,055 INFO L480 AbstractCegarLoop]: Abstraction has 54424 states and 59432 transitions. [2018-11-06 21:45:49,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:45:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 54424 states and 59432 transitions. [2018-11-06 21:45:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-06 21:45:49,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:49,070 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:45:49,070 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:49,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 597147162, now seen corresponding path program 1 times [2018-11-06 21:45:49,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:49,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:49,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-06 21:45:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:45:49,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:45:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:45:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:49,524 INFO L87 Difference]: Start difference. First operand 54424 states and 59432 transitions. Second operand 4 states. [2018-11-06 21:45:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:55,009 INFO L93 Difference]: Finished difference Result 129777 states and 142398 transitions. [2018-11-06 21:45:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:45:55,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2018-11-06 21:45:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:55,087 INFO L225 Difference]: With dead ends: 129777 [2018-11-06 21:45:55,087 INFO L226 Difference]: Without dead ends: 68034 [2018-11-06 21:45:55,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68034 states. [2018-11-06 21:45:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68034 to 62903. [2018-11-06 21:45:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62903 states. [2018-11-06 21:45:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62903 states to 62903 states and 67500 transitions. [2018-11-06 21:45:55,850 INFO L78 Accepts]: Start accepts. Automaton has 62903 states and 67500 transitions. Word has length 383 [2018-11-06 21:45:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:55,850 INFO L480 AbstractCegarLoop]: Abstraction has 62903 states and 67500 transitions. [2018-11-06 21:45:55,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:45:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 62903 states and 67500 transitions. [2018-11-06 21:45:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-06 21:45:55,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:55,879 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 21:45:55,879 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:55,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1909245855, now seen corresponding path program 1 times [2018-11-06 21:45:55,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2018-11-06 21:45:56,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:56,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:56,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:56,306 INFO L87 Difference]: Start difference. First operand 62903 states and 67500 transitions. Second operand 3 states. [2018-11-06 21:45:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:59,426 INFO L93 Difference]: Finished difference Result 133917 states and 143595 transitions. [2018-11-06 21:45:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:59,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2018-11-06 21:45:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:59,502 INFO L225 Difference]: With dead ends: 133917 [2018-11-06 21:45:59,502 INFO L226 Difference]: Without dead ends: 68446 [2018-11-06 21:45:59,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68446 states. [2018-11-06 21:46:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68446 to 64591. [2018-11-06 21:46:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64591 states. [2018-11-06 21:46:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64591 states to 64591 states and 69171 transitions. [2018-11-06 21:46:00,249 INFO L78 Accepts]: Start accepts. Automaton has 64591 states and 69171 transitions. Word has length 471 [2018-11-06 21:46:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:00,250 INFO L480 AbstractCegarLoop]: Abstraction has 64591 states and 69171 transitions. [2018-11-06 21:46:00,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 64591 states and 69171 transitions. [2018-11-06 21:46:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-11-06 21:46:00,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:00,305 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:00,305 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:00,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1997589549, now seen corresponding path program 1 times [2018-11-06 21:46:00,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:00,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:00,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:01,150 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-06 21:46:01,494 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-11-06 21:46:01,772 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-06 21:46:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 505 proven. 171 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-06 21:46:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:46:02,772 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:46:02,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:02,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:46:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:46:03,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:46:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-11-06 21:46:03,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:46:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:46:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:46:03,555 INFO L87 Difference]: Start difference. First operand 64591 states and 69171 transitions. Second operand 12 states. [2018-11-06 21:46:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:11,932 INFO L93 Difference]: Finished difference Result 137819 states and 147656 transitions. [2018-11-06 21:46:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:46:11,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 676 [2018-11-06 21:46:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:12,010 INFO L225 Difference]: With dead ends: 137819 [2018-11-06 21:46:12,010 INFO L226 Difference]: Without dead ends: 67103 [2018-11-06 21:46:12,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 679 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=155, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:46:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67103 states. [2018-11-06 21:46:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67103 to 55572. [2018-11-06 21:46:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55572 states. [2018-11-06 21:46:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55572 states to 55572 states and 59741 transitions. [2018-11-06 21:46:12,692 INFO L78 Accepts]: Start accepts. Automaton has 55572 states and 59741 transitions. Word has length 676 [2018-11-06 21:46:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:12,692 INFO L480 AbstractCegarLoop]: Abstraction has 55572 states and 59741 transitions. [2018-11-06 21:46:12,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:46:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55572 states and 59741 transitions. [2018-11-06 21:46:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2018-11-06 21:46:12,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:12,741 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:12,741 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:12,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash 676361286, now seen corresponding path program 1 times [2018-11-06 21:46:12,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:12,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-06 21:46:13,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:13,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:13,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:13,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:13,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:13,524 INFO L87 Difference]: Start difference. First operand 55572 states and 59741 transitions. Second operand 3 states. [2018-11-06 21:46:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:16,224 INFO L93 Difference]: Finished difference Result 123918 states and 133410 transitions. [2018-11-06 21:46:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:16,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 767 [2018-11-06 21:46:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:16,310 INFO L225 Difference]: With dead ends: 123918 [2018-11-06 21:46:16,310 INFO L226 Difference]: Without dead ends: 66207 [2018-11-06 21:46:16,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66207 states. [2018-11-06 21:46:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66207 to 63651. [2018-11-06 21:46:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63651 states. [2018-11-06 21:46:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63651 states to 63651 states and 68194 transitions. [2018-11-06 21:46:17,248 INFO L78 Accepts]: Start accepts. Automaton has 63651 states and 68194 transitions. Word has length 767 [2018-11-06 21:46:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:17,249 INFO L480 AbstractCegarLoop]: Abstraction has 63651 states and 68194 transitions. [2018-11-06 21:46:17,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 63651 states and 68194 transitions. [2018-11-06 21:46:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-11-06 21:46:17,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:17,281 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:17,281 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:17,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash -969604512, now seen corresponding path program 1 times [2018-11-06 21:46:17,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:17,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:17,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2018-11-06 21:46:18,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:18,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:18,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:18,046 INFO L87 Difference]: Start difference. First operand 63651 states and 68194 transitions. Second operand 3 states. [2018-11-06 21:46:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:20,343 INFO L93 Difference]: Finished difference Result 128579 states and 137700 transitions. [2018-11-06 21:46:20,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:20,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 831 [2018-11-06 21:46:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:20,404 INFO L225 Difference]: With dead ends: 128579 [2018-11-06 21:46:20,404 INFO L226 Difference]: Without dead ends: 65356 [2018-11-06 21:46:20,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65356 states. [2018-11-06 21:46:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65356 to 63220. [2018-11-06 21:46:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63220 states. [2018-11-06 21:46:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63220 states to 63220 states and 67530 transitions. [2018-11-06 21:46:21,010 INFO L78 Accepts]: Start accepts. Automaton has 63220 states and 67530 transitions. Word has length 831 [2018-11-06 21:46:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:21,010 INFO L480 AbstractCegarLoop]: Abstraction has 63220 states and 67530 transitions. [2018-11-06 21:46:21,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 63220 states and 67530 transitions. [2018-11-06 21:46:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2018-11-06 21:46:21,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:21,061 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:21,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:21,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1858572537, now seen corresponding path program 1 times [2018-11-06 21:46:21,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:21,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:21,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1461 backedges. 890 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2018-11-06 21:46:22,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:22,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:22,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:22,480 INFO L87 Difference]: Start difference. First operand 63220 states and 67530 transitions. Second operand 3 states. [2018-11-06 21:46:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:25,430 INFO L93 Difference]: Finished difference Result 133250 states and 142249 transitions. [2018-11-06 21:46:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:25,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 968 [2018-11-06 21:46:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:25,499 INFO L225 Difference]: With dead ends: 133250 [2018-11-06 21:46:25,499 INFO L226 Difference]: Without dead ends: 70458 [2018-11-06 21:46:25,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70458 states. [2018-11-06 21:46:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70458 to 69596. [2018-11-06 21:46:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69596 states. [2018-11-06 21:46:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69596 states to 69596 states and 73948 transitions. [2018-11-06 21:46:26,170 INFO L78 Accepts]: Start accepts. Automaton has 69596 states and 73948 transitions. Word has length 968 [2018-11-06 21:46:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:26,171 INFO L480 AbstractCegarLoop]: Abstraction has 69596 states and 73948 transitions. [2018-11-06 21:46:26,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 69596 states and 73948 transitions. [2018-11-06 21:46:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2018-11-06 21:46:26,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:26,215 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:26,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:26,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1636992907, now seen corresponding path program 1 times [2018-11-06 21:46:26,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 775 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2018-11-06 21:46:27,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:27,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:27,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:27,836 INFO L87 Difference]: Start difference. First operand 69596 states and 73948 transitions. Second operand 3 states. [2018-11-06 21:46:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:30,537 INFO L93 Difference]: Finished difference Result 137908 states and 146497 transitions. [2018-11-06 21:46:30,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:30,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 990 [2018-11-06 21:46:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:30,600 INFO L225 Difference]: With dead ends: 137908 [2018-11-06 21:46:30,600 INFO L226 Difference]: Without dead ends: 68739 [2018-11-06 21:46:30,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68739 states. [2018-11-06 21:46:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68739 to 63611. [2018-11-06 21:46:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63611 states. [2018-11-06 21:46:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63611 states to 63611 states and 67563 transitions. [2018-11-06 21:46:31,186 INFO L78 Accepts]: Start accepts. Automaton has 63611 states and 67563 transitions. Word has length 990 [2018-11-06 21:46:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:31,187 INFO L480 AbstractCegarLoop]: Abstraction has 63611 states and 67563 transitions. [2018-11-06 21:46:31,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 63611 states and 67563 transitions. [2018-11-06 21:46:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2018-11-06 21:46:31,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:31,226 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:31,226 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:31,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2070558093, now seen corresponding path program 1 times [2018-11-06 21:46:31,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-11-06 21:46:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:32,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:32,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:32,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:32,911 INFO L87 Difference]: Start difference. First operand 63611 states and 67563 transitions. Second operand 3 states. [2018-11-06 21:46:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:35,364 INFO L93 Difference]: Finished difference Result 127219 states and 135073 transitions. [2018-11-06 21:46:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:35,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1046 [2018-11-06 21:46:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:35,426 INFO L225 Difference]: With dead ends: 127219 [2018-11-06 21:46:35,426 INFO L226 Difference]: Without dead ends: 63609 [2018-11-06 21:46:35,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63609 states. [2018-11-06 21:46:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63609 to 58483. [2018-11-06 21:46:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58483 states. [2018-11-06 21:46:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58483 states to 58483 states and 61993 transitions. [2018-11-06 21:46:35,971 INFO L78 Accepts]: Start accepts. Automaton has 58483 states and 61993 transitions. Word has length 1046 [2018-11-06 21:46:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:35,972 INFO L480 AbstractCegarLoop]: Abstraction has 58483 states and 61993 transitions. [2018-11-06 21:46:35,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58483 states and 61993 transitions. [2018-11-06 21:46:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1141 [2018-11-06 21:46:36,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:36,023 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:46:36,023 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:36,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1564676778, now seen corresponding path program 1 times [2018-11-06 21:46:36,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-11-06 21:46:37,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:37,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:37,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:37,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:37,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:37,758 INFO L87 Difference]: Start difference. First operand 58483 states and 61993 transitions. Second operand 3 states. [2018-11-06 21:46:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:40,091 INFO L93 Difference]: Finished difference Result 115256 states and 122101 transitions. [2018-11-06 21:46:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:40,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1140 [2018-11-06 21:46:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:40,144 INFO L225 Difference]: With dead ends: 115256 [2018-11-06 21:46:40,144 INFO L226 Difference]: Without dead ends: 57201 [2018-11-06 21:46:40,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57201 states. [2018-11-06 21:46:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57201 to 55922. [2018-11-06 21:46:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55922 states. [2018-11-06 21:46:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55922 states to 55922 states and 58692 transitions. [2018-11-06 21:46:40,882 INFO L78 Accepts]: Start accepts. Automaton has 55922 states and 58692 transitions. Word has length 1140 [2018-11-06 21:46:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:40,883 INFO L480 AbstractCegarLoop]: Abstraction has 55922 states and 58692 transitions. [2018-11-06 21:46:40,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 55922 states and 58692 transitions. [2018-11-06 21:46:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2018-11-06 21:46:40,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:40,925 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:46:40,925 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:40,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -940056304, now seen corresponding path program 1 times [2018-11-06 21:46:40,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:40,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:40,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:40,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2039 backedges. 1373 proven. 461 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-11-06 21:46:42,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:46:42,834 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:46:42,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:43,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:46:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2039 backedges. 854 proven. 83 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2018-11-06 21:46:44,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:46:44,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 8 [2018-11-06 21:46:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:46:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:46:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:46:44,699 INFO L87 Difference]: Start difference. First operand 55922 states and 58692 transitions. Second operand 9 states. [2018-11-06 21:47:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:00,942 INFO L93 Difference]: Finished difference Result 128475 states and 134819 transitions. [2018-11-06 21:47:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:47:00,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1185 [2018-11-06 21:47:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:01,007 INFO L225 Difference]: With dead ends: 128475 [2018-11-06 21:47:01,008 INFO L226 Difference]: Without dead ends: 72981 [2018-11-06 21:47:01,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1183 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:47:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72981 states. [2018-11-06 21:47:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72981 to 67849. [2018-11-06 21:47:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67849 states. [2018-11-06 21:47:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67849 states to 67849 states and 70790 transitions. [2018-11-06 21:47:01,630 INFO L78 Accepts]: Start accepts. Automaton has 67849 states and 70790 transitions. Word has length 1185 [2018-11-06 21:47:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:01,630 INFO L480 AbstractCegarLoop]: Abstraction has 67849 states and 70790 transitions. [2018-11-06 21:47:01,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:47:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 67849 states and 70790 transitions. [2018-11-06 21:47:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2018-11-06 21:47:01,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:01,677 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:47:01,678 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:01,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 937408991, now seen corresponding path program 1 times [2018-11-06 21:47:01,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 1585 proven. 0 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2018-11-06 21:47:02,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:02,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:47:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:47:02,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:47:02,970 INFO L87 Difference]: Start difference. First operand 67849 states and 70790 transitions. Second operand 3 states. [2018-11-06 21:47:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:05,426 INFO L93 Difference]: Finished difference Result 136989 states and 143084 transitions. [2018-11-06 21:47:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:47:05,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1194 [2018-11-06 21:47:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:05,503 INFO L225 Difference]: With dead ends: 136989 [2018-11-06 21:47:05,504 INFO L226 Difference]: Without dead ends: 77238 [2018-11-06 21:47:05,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:47:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77238 states. [2018-11-06 21:47:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77238 to 73807. [2018-11-06 21:47:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73807 states. [2018-11-06 21:47:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73807 states to 73807 states and 77060 transitions. [2018-11-06 21:47:06,206 INFO L78 Accepts]: Start accepts. Automaton has 73807 states and 77060 transitions. Word has length 1194 [2018-11-06 21:47:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:06,206 INFO L480 AbstractCegarLoop]: Abstraction has 73807 states and 77060 transitions. [2018-11-06 21:47:06,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:47:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 73807 states and 77060 transitions. [2018-11-06 21:47:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-11-06 21:47:06,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:06,261 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:47:06,262 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:06,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1390786172, now seen corresponding path program 1 times [2018-11-06 21:47:06,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:06,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:06,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 2170 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2018-11-06 21:47:08,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:08,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:47:08,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:47:08,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:47:08,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:47:08,028 INFO L87 Difference]: Start difference. First operand 73807 states and 77060 transitions. Second operand 6 states. [2018-11-06 21:47:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:16,591 INFO L93 Difference]: Finished difference Result 161712 states and 169263 transitions. [2018-11-06 21:47:16,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:47:16,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1280 [2018-11-06 21:47:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:16,682 INFO L225 Difference]: With dead ends: 161712 [2018-11-06 21:47:16,683 INFO L226 Difference]: Without dead ends: 95577 [2018-11-06 21:47:16,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:47:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95577 states. [2018-11-06 21:47:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95577 to 87037. [2018-11-06 21:47:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87037 states. [2018-11-06 21:47:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87037 states to 87037 states and 90698 transitions. [2018-11-06 21:47:17,550 INFO L78 Accepts]: Start accepts. Automaton has 87037 states and 90698 transitions. Word has length 1280 [2018-11-06 21:47:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:17,551 INFO L480 AbstractCegarLoop]: Abstraction has 87037 states and 90698 transitions. [2018-11-06 21:47:17,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:47:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 87037 states and 90698 transitions. [2018-11-06 21:47:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2018-11-06 21:47:17,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:17,612 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:47:17,612 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:17,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash 157920089, now seen corresponding path program 1 times [2018-11-06 21:47:17,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:17,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:17,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 2383 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-11-06 21:47:19,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:19,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:47:19,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:47:19,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:47:19,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:47:19,329 INFO L87 Difference]: Start difference. First operand 87037 states and 90698 transitions. Second operand 6 states. [2018-11-06 21:47:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:27,325 INFO L93 Difference]: Finished difference Result 188170 states and 196546 transitions. [2018-11-06 21:47:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:47:27,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1349 [2018-11-06 21:47:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:27,438 INFO L225 Difference]: With dead ends: 188170 [2018-11-06 21:47:27,438 INFO L226 Difference]: Without dead ends: 108805 [2018-11-06 21:47:27,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:47:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108805 states. [2018-11-06 21:47:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108805 to 88741. [2018-11-06 21:47:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88741 states. [2018-11-06 21:47:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88741 states to 88741 states and 92472 transitions. [2018-11-06 21:47:28,389 INFO L78 Accepts]: Start accepts. Automaton has 88741 states and 92472 transitions. Word has length 1349 [2018-11-06 21:47:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:28,389 INFO L480 AbstractCegarLoop]: Abstraction has 88741 states and 92472 transitions. [2018-11-06 21:47:28,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:47:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88741 states and 92472 transitions. [2018-11-06 21:47:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2018-11-06 21:47:28,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:28,451 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:47:28,451 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:28,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash 776854987, now seen corresponding path program 1 times [2018-11-06 21:47:28,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:28,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-06 21:47:29,042 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-06 21:47:29,046 INFO L168 Benchmark]: Toolchain (without parser) took 233494.55 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -486.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:47:29,047 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:47:29,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1501.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:29,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 519.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 802.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -935.8 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:29,049 INFO L168 Benchmark]: Boogie Preprocessor took 279.00 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:29,050 INFO L168 Benchmark]: RCFGBuilder took 8702.77 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 487.2 MB). Peak memory consumption was 487.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:29,051 INFO L168 Benchmark]: TraceAbstraction took 222485.76 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: -215.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:47:29,057 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 1501.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 519.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 802.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -935.8 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 279.00 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8702.77 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 487.2 MB). Peak memory consumption was 487.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222485.76 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: -215.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown