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_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:47:31,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:47:31,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:47:31,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:47:31,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:47:31,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:47:31,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:47:31,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:47:31,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:47:31,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:47:31,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:47:31,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:47:31,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:47:31,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:47:31,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:47:31,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:47:31,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:47:31,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:47:31,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:47:31,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:47:31,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:47:31,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:47:31,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:47:31,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:47:31,559 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:47:31,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:47:31,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:47:31,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:47:31,562 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:47:31,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:47:31,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:47:31,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:47:31,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:47:31,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:47:31,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:47:31,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:47:31,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:47:31,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:47:31,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:47:31,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:47:31,584 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:47:31,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:47:31,585 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:47:31,585 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:47:31,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:47:31,586 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:47:31,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:47:31,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:47:31,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:47:31,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:47:31,587 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:47:31,587 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:47:31,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:47:31,587 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:47:31,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:47:31,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:47:31,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:47:31,588 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:47:31,588 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:47:31,589 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:47:31,589 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:47:31,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:47:31,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:47:31,589 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:47:31,590 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:47:31,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:47:31,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:47:31,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:47:31,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:47:31,655 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:47:31,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label51_true-unreach-call.c [2018-11-06 21:47:31,717 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57af5d512/1fc1f1ee14cb4cca972a7af4d5280910/FLAGbfb9d4afd [2018-11-06 21:47:32,407 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:47:32,408 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label51_true-unreach-call.c [2018-11-06 21:47:32,437 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57af5d512/1fc1f1ee14cb4cca972a7af4d5280910/FLAGbfb9d4afd [2018-11-06 21:47:32,459 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57af5d512/1fc1f1ee14cb4cca972a7af4d5280910 [2018-11-06 21:47:32,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:47:32,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:47:32,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:47:32,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:47:32,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:47:32,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:47:32" (1/1) ... [2018-11-06 21:47:32,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d6e334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:32, skipping insertion in model container [2018-11-06 21:47:32,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:47:32" (1/1) ... [2018-11-06 21:47:32,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:47:32,612 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:47:33,581 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:47:33,586 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:47:33,984 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:47:34,008 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:47:34,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34 WrapperNode [2018-11-06 21:47:34,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:47:34,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:47:34,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:47:34,011 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:47:34,024 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:47:34" (1/1) ... [2018-11-06 21:47:34,295 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:47:34" (1/1) ... [2018-11-06 21:47:34,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:47:34,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:47:34,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:47:34,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:47:34,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (1/1) ... [2018-11-06 21:47:34,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:47:34,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:47:34,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:47:34,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:47:34,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (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:47:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:47:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:47:34,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:47:43,843 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:47:43,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:47:43 BoogieIcfgContainer [2018-11-06 21:47:43,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:47:43,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:47:43,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:47:43,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:47:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:47:32" (1/3) ... [2018-11-06 21:47:43,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a8b1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:47:43, skipping insertion in model container [2018-11-06 21:47:43,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:47:34" (2/3) ... [2018-11-06 21:47:43,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a8b1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:47:43, skipping insertion in model container [2018-11-06 21:47:43,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:47:43" (3/3) ... [2018-11-06 21:47:43,857 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label51_true-unreach-call.c [2018-11-06 21:47:43,867 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:47:43,877 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:47:43,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:47:43,944 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:47:43,945 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:47:43,945 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:47:43,945 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:47:43,945 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:47:43,945 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:47:43,946 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:47:43,946 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:47:43,946 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:47:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:47:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 21:47:43,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:43,988 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] [2018-11-06 21:47:43,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:43,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -387853398, now seen corresponding path program 1 times [2018-11-06 21:47:43,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:44,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:44,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:44,440 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:47:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:44,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:47:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:47:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:47:44,473 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:47:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:52,648 INFO L93 Difference]: Finished difference Result 2124 states and 3951 transitions. [2018-11-06 21:47:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:47:52,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-06 21:47:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:52,688 INFO L225 Difference]: With dead ends: 2124 [2018-11-06 21:47:52,689 INFO L226 Difference]: Without dead ends: 1526 [2018-11-06 21:47:52,696 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:47:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2018-11-06 21:47:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1032. [2018-11-06 21:47:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-06 21:47:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1858 transitions. [2018-11-06 21:47:52,823 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1858 transitions. Word has length 38 [2018-11-06 21:47:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:52,823 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1858 transitions. [2018-11-06 21:47:52,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:47:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1858 transitions. [2018-11-06 21:47:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-06 21:47:52,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:52,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,833 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:52,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2126674366, now seen corresponding path program 1 times [2018-11-06 21:47:52,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:52,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:47:53,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:53,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:53,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:47:53,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:47:53,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:47:53,096 INFO L87 Difference]: Start difference. First operand 1032 states and 1858 transitions. Second operand 4 states. [2018-11-06 21:48:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:00,826 INFO L93 Difference]: Finished difference Result 2924 states and 5354 transitions. [2018-11-06 21:48:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:48:00,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-06 21:48:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:00,839 INFO L225 Difference]: With dead ends: 2924 [2018-11-06 21:48:00,840 INFO L226 Difference]: Without dead ends: 1894 [2018-11-06 21:48:00,842 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:48:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2018-11-06 21:48:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2018-11-06 21:48:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2018-11-06 21:48:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2838 transitions. [2018-11-06 21:48:00,885 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2838 transitions. Word has length 106 [2018-11-06 21:48:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:00,885 INFO L480 AbstractCegarLoop]: Abstraction has 1894 states and 2838 transitions. [2018-11-06 21:48:00,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:48:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2838 transitions. [2018-11-06 21:48:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-06 21:48:00,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:00,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,889 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:00,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1372525769, now seen corresponding path program 1 times [2018-11-06 21:48:00,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:00,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:00,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:48:01,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:01,234 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:48:01,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:01,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:48:01,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:48:01,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:48:01,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:48:01,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:48:01,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:48:01,618 INFO L87 Difference]: Start difference. First operand 1894 states and 2838 transitions. Second operand 6 states. [2018-11-06 21:48:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:14,189 INFO L93 Difference]: Finished difference Result 7665 states and 11401 transitions. [2018-11-06 21:48:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:48:14,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-11-06 21:48:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:14,216 INFO L225 Difference]: With dead ends: 7665 [2018-11-06 21:48:14,217 INFO L226 Difference]: Without dead ends: 3983 [2018-11-06 21:48:14,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:48:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2018-11-06 21:48:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3981. [2018-11-06 21:48:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2018-11-06 21:48:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4944 transitions. [2018-11-06 21:48:14,295 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4944 transitions. Word has length 109 [2018-11-06 21:48:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:14,295 INFO L480 AbstractCegarLoop]: Abstraction has 3981 states and 4944 transitions. [2018-11-06 21:48:14,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:48:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4944 transitions. [2018-11-06 21:48:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-06 21:48:14,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:14,303 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:48:14,303 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:14,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1353365610, now seen corresponding path program 1 times [2018-11-06 21:48:14,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:14,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 21:48:14,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:14,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:48:14,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:48:14,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:48:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:48:14,543 INFO L87 Difference]: Start difference. First operand 3981 states and 4944 transitions. Second operand 3 states. [2018-11-06 21:48:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:17,325 INFO L93 Difference]: Finished difference Result 10084 states and 12888 transitions. [2018-11-06 21:48:17,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:48:17,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-11-06 21:48:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:17,358 INFO L225 Difference]: With dead ends: 10084 [2018-11-06 21:48:17,358 INFO L226 Difference]: Without dead ends: 6540 [2018-11-06 21:48:17,364 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:48:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6540 states. [2018-11-06 21:48:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6540 to 6540. [2018-11-06 21:48:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6540 states. [2018-11-06 21:48:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6540 states to 6540 states and 7960 transitions. [2018-11-06 21:48:17,467 INFO L78 Accepts]: Start accepts. Automaton has 6540 states and 7960 transitions. Word has length 259 [2018-11-06 21:48:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:17,468 INFO L480 AbstractCegarLoop]: Abstraction has 6540 states and 7960 transitions. [2018-11-06 21:48:17,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:48:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6540 states and 7960 transitions. [2018-11-06 21:48:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-06 21:48:17,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:17,476 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:48:17,477 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:17,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash -144031712, now seen corresponding path program 1 times [2018-11-06 21:48:17,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:17,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:17,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 355 proven. 83 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-06 21:48:18,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:18,059 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:48:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:18,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 355 proven. 83 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-06 21:48:18,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:48:18,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-06 21:48:18,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:48:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:48:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:48:18,643 INFO L87 Difference]: Start difference. First operand 6540 states and 7960 transitions. Second operand 7 states. [2018-11-06 21:48:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:27,709 INFO L93 Difference]: Finished difference Result 25892 states and 31137 transitions. [2018-11-06 21:48:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:48:27,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 364 [2018-11-06 21:48:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:27,775 INFO L225 Difference]: With dead ends: 25892 [2018-11-06 21:48:27,775 INFO L226 Difference]: Without dead ends: 17621 [2018-11-06 21:48:27,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:48:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2018-11-06 21:48:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 16751. [2018-11-06 21:48:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16751 states. [2018-11-06 21:48:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16751 states to 16751 states and 19005 transitions. [2018-11-06 21:48:28,070 INFO L78 Accepts]: Start accepts. Automaton has 16751 states and 19005 transitions. Word has length 364 [2018-11-06 21:48:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:28,071 INFO L480 AbstractCegarLoop]: Abstraction has 16751 states and 19005 transitions. [2018-11-06 21:48:28,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:48:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 16751 states and 19005 transitions. [2018-11-06 21:48:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-06 21:48:28,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:28,085 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:48:28,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:28,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash -902309086, now seen corresponding path program 1 times [2018-11-06 21:48:28,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:28,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:28,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:28,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2018-11-06 21:48:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:48:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:48:28,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:48:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:48:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:48:28,529 INFO L87 Difference]: Start difference. First operand 16751 states and 19005 transitions. Second operand 3 states. [2018-11-06 21:48:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:32,590 INFO L93 Difference]: Finished difference Result 39471 states and 44754 transitions. [2018-11-06 21:48:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:48:32,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2018-11-06 21:48:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:32,633 INFO L225 Difference]: With dead ends: 39471 [2018-11-06 21:48:32,633 INFO L226 Difference]: Without dead ends: 22721 [2018-11-06 21:48:32,651 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:48:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22721 states. [2018-11-06 21:48:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22721 to 17590. [2018-11-06 21:48:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17590 states. [2018-11-06 21:48:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 19880 transitions. [2018-11-06 21:48:32,911 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 19880 transitions. Word has length 470 [2018-11-06 21:48:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:32,912 INFO L480 AbstractCegarLoop]: Abstraction has 17590 states and 19880 transitions. [2018-11-06 21:48:32,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:48:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 19880 transitions. [2018-11-06 21:48:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-11-06 21:48:32,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:32,936 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:48:32,936 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:32,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash 532838612, now seen corresponding path program 1 times [2018-11-06 21:48:32,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:32,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:32,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 419 proven. 83 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-06 21:48:34,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:34,187 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:48:34,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:34,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 419 proven. 83 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-06 21:48:34,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:48:34,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-06 21:48:34,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:48:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:48:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:48:34,847 INFO L87 Difference]: Start difference. First operand 17590 states and 19880 transitions. Second operand 9 states. [2018-11-06 21:48:35,091 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 21:48:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:48:42,636 INFO L93 Difference]: Finished difference Result 36886 states and 41558 transitions. [2018-11-06 21:48:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:48:42,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 593 [2018-11-06 21:48:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:48:42,661 INFO L225 Difference]: With dead ends: 36886 [2018-11-06 21:48:42,661 INFO L226 Difference]: Without dead ends: 19724 [2018-11-06 21:48:42,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:48:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19724 states. [2018-11-06 21:48:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19724 to 19720. [2018-11-06 21:48:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19720 states. [2018-11-06 21:48:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19720 states to 19720 states and 22076 transitions. [2018-11-06 21:48:42,901 INFO L78 Accepts]: Start accepts. Automaton has 19720 states and 22076 transitions. Word has length 593 [2018-11-06 21:48:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:48:42,902 INFO L480 AbstractCegarLoop]: Abstraction has 19720 states and 22076 transitions. [2018-11-06 21:48:42,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:48:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 19720 states and 22076 transitions. [2018-11-06 21:48:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-11-06 21:48:42,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:48:42,939 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-06 21:48:42,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:48:42,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:48:42,940 INFO L82 PathProgramCache]: Analyzing trace with hash -750196100, now seen corresponding path program 1 times [2018-11-06 21:48:42,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:48:42,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:48:42,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:42,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:48:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 488 proven. 389 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-06 21:48:44,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:48:44,002 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:48:44,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:48:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:48:44,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:48:44,781 WARN L179 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 20 [2018-11-06 21:48:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-11-06 21:48:45,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:48:45,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:48:45,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:48:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:48:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:48:45,291 INFO L87 Difference]: Start difference. First operand 19720 states and 22076 transitions. Second operand 7 states. [2018-11-06 21:49:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:51,805 INFO L93 Difference]: Finished difference Result 66758 states and 75374 transitions. [2018-11-06 21:49:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:49:51,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 669 [2018-11-06 21:49:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:51,860 INFO L225 Difference]: With dead ends: 66758 [2018-11-06 21:49:51,860 INFO L226 Difference]: Without dead ends: 47462 [2018-11-06 21:49:51,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 672 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:49:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47462 states. [2018-11-06 21:49:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47462 to 38051. [2018-11-06 21:49:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38051 states. [2018-11-06 21:49:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38051 states to 38051 states and 41578 transitions. [2018-11-06 21:49:52,340 INFO L78 Accepts]: Start accepts. Automaton has 38051 states and 41578 transitions. Word has length 669 [2018-11-06 21:49:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:52,341 INFO L480 AbstractCegarLoop]: Abstraction has 38051 states and 41578 transitions. [2018-11-06 21:49:52,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:49:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38051 states and 41578 transitions. [2018-11-06 21:49:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2018-11-06 21:49:52,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:52,390 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:52,390 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:52,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1221331625, now seen corresponding path program 1 times [2018-11-06 21:49:52,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:52,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:52,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:52,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:52,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2018-11-06 21:49:53,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:49:53,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:49:53,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:49:53,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:49:53,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:49:53,237 INFO L87 Difference]: Start difference. First operand 38051 states and 41578 transitions. Second operand 3 states. [2018-11-06 21:49:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:49:56,884 INFO L93 Difference]: Finished difference Result 93590 states and 102566 transitions. [2018-11-06 21:49:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:49:56,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 767 [2018-11-06 21:49:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:49:56,948 INFO L225 Difference]: With dead ends: 93590 [2018-11-06 21:49:56,948 INFO L226 Difference]: Without dead ends: 57671 [2018-11-06 21:49:56,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:49:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57671 states. [2018-11-06 21:49:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57671 to 50836. [2018-11-06 21:49:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50836 states. [2018-11-06 21:49:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50836 states to 50836 states and 55815 transitions. [2018-11-06 21:49:57,591 INFO L78 Accepts]: Start accepts. Automaton has 50836 states and 55815 transitions. Word has length 767 [2018-11-06 21:49:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:49:57,592 INFO L480 AbstractCegarLoop]: Abstraction has 50836 states and 55815 transitions. [2018-11-06 21:49:57,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:49:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 50836 states and 55815 transitions. [2018-11-06 21:49:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2018-11-06 21:49:57,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:49:57,627 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,627 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:49:57,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:49:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash -175703914, now seen corresponding path program 1 times [2018-11-06 21:49:57,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:49:57,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:49:57,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:57,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:49:57,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:49:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:49:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2018-11-06 21:49:58,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:49:58,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:49:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:49:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:49:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:49:58,940 INFO L87 Difference]: Start difference. First operand 50836 states and 55815 transitions. Second operand 5 states. [2018-11-06 21:50:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:04,662 INFO L93 Difference]: Finished difference Result 109781 states and 121226 transitions. [2018-11-06 21:50:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:50:04,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 809 [2018-11-06 21:50:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:04,736 INFO L225 Difference]: With dead ends: 109781 [2018-11-06 21:50:04,737 INFO L226 Difference]: Without dead ends: 65347 [2018-11-06 21:50:04,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:50:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65347 states. [2018-11-06 21:50:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65347 to 55539. [2018-11-06 21:50:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55539 states. [2018-11-06 21:50:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55539 states to 55539 states and 60944 transitions. [2018-11-06 21:50:05,309 INFO L78 Accepts]: Start accepts. Automaton has 55539 states and 60944 transitions. Word has length 809 [2018-11-06 21:50:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:05,310 INFO L480 AbstractCegarLoop]: Abstraction has 55539 states and 60944 transitions. [2018-11-06 21:50:05,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:50:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 55539 states and 60944 transitions. [2018-11-06 21:50:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-11-06 21:50:05,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:05,333 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,333 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:05,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1566453425, now seen corresponding path program 1 times [2018-11-06 21:50:05,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:05,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:05,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:05,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:05,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 515 proven. 36 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2018-11-06 21:50:06,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:50:06,833 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:50:06,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:07,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:50:07,389 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 16 [2018-11-06 21:50:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2018-11-06 21:50:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:50:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-06 21:50:07,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:50:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:50:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:50:07,950 INFO L87 Difference]: Start difference. First operand 55539 states and 60944 transitions. Second operand 7 states. [2018-11-06 21:50:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:26,903 INFO L93 Difference]: Finished difference Result 138813 states and 152174 transitions. [2018-11-06 21:50:26,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:50:26,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 814 [2018-11-06 21:50:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:26,984 INFO L225 Difference]: With dead ends: 138813 [2018-11-06 21:50:26,984 INFO L226 Difference]: Without dead ends: 83275 [2018-11-06 21:50:27,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:50:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83275 states. [2018-11-06 21:50:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83275 to 55530. [2018-11-06 21:50:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55530 states. [2018-11-06 21:50:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55530 states to 55530 states and 59896 transitions. [2018-11-06 21:50:27,771 INFO L78 Accepts]: Start accepts. Automaton has 55530 states and 59896 transitions. Word has length 814 [2018-11-06 21:50:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:27,771 INFO L480 AbstractCegarLoop]: Abstraction has 55530 states and 59896 transitions. [2018-11-06 21:50:27,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:50:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 55530 states and 59896 transitions. [2018-11-06 21:50:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2018-11-06 21:50:27,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:27,810 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:50:27,810 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:27,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:27,811 INFO L82 PathProgramCache]: Analyzing trace with hash 560682652, now seen corresponding path program 1 times [2018-11-06 21:50:27,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:27,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:27,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:27,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1732 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2018-11-06 21:50:28,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:28,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:50:28,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:50:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:50:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:28,968 INFO L87 Difference]: Start difference. First operand 55530 states and 59896 transitions. Second operand 3 states. [2018-11-06 21:50:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:30,738 INFO L93 Difference]: Finished difference Result 105075 states and 113431 transitions. [2018-11-06 21:50:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:50:30,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 957 [2018-11-06 21:50:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:30,792 INFO L225 Difference]: With dead ends: 105075 [2018-11-06 21:50:30,792 INFO L226 Difference]: Without dead ends: 53810 [2018-11-06 21:50:30,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53810 states. [2018-11-06 21:50:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53810 to 52955. [2018-11-06 21:50:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52955 states. [2018-11-06 21:50:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52955 states to 52955 states and 57056 transitions. [2018-11-06 21:50:31,370 INFO L78 Accepts]: Start accepts. Automaton has 52955 states and 57056 transitions. Word has length 957 [2018-11-06 21:50:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:31,370 INFO L480 AbstractCegarLoop]: Abstraction has 52955 states and 57056 transitions. [2018-11-06 21:50:31,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:50:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 52955 states and 57056 transitions. [2018-11-06 21:50:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2018-11-06 21:50:31,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:31,404 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:50:31,404 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:31,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -393890786, now seen corresponding path program 1 times [2018-11-06 21:50:31,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:31,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:31,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:32,358 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-06 21:50:32,581 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-06 21:50:32,849 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-11-06 21:50:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1732 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2018-11-06 21:50:33,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:33,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:50:33,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:50:33,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:50:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:50:33,916 INFO L87 Difference]: Start difference. First operand 52955 states and 57056 transitions. Second operand 5 states. [2018-11-06 21:50:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:41,353 INFO L93 Difference]: Finished difference Result 111028 states and 119629 transitions. [2018-11-06 21:50:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:50:41,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 957 [2018-11-06 21:50:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:41,413 INFO L225 Difference]: With dead ends: 111028 [2018-11-06 21:50:41,414 INFO L226 Difference]: Without dead ends: 63619 [2018-11-06 21:50:41,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:50:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63619 states. [2018-11-06 21:50:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63619 to 58069. [2018-11-06 21:50:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58069 states. [2018-11-06 21:50:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58069 states to 58069 states and 62274 transitions. [2018-11-06 21:50:41,961 INFO L78 Accepts]: Start accepts. Automaton has 58069 states and 62274 transitions. Word has length 957 [2018-11-06 21:50:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:41,962 INFO L480 AbstractCegarLoop]: Abstraction has 58069 states and 62274 transitions. [2018-11-06 21:50:41,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:50:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 58069 states and 62274 transitions. [2018-11-06 21:50:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-11-06 21:50:41,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:41,993 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:50:41,994 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:41,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1770551083, now seen corresponding path program 1 times [2018-11-06 21:50:41,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:41,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:41,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:41,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:41,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 1522 proven. 0 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2018-11-06 21:50:44,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:50:44,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:50:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:50:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:50:44,242 INFO L87 Difference]: Start difference. First operand 58069 states and 62274 transitions. Second operand 6 states. [2018-11-06 21:50:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:50,334 INFO L93 Difference]: Finished difference Result 127659 states and 137523 transitions. [2018-11-06 21:50:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:50:50,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1111 [2018-11-06 21:50:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:50,403 INFO L225 Difference]: With dead ends: 127659 [2018-11-06 21:50:50,404 INFO L226 Difference]: Without dead ends: 74710 [2018-11-06 21:50:50,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:50:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74710 states. [2018-11-06 21:50:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74710 to 54230. [2018-11-06 21:50:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54230 states. [2018-11-06 21:50:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54230 states to 54230 states and 57896 transitions. [2018-11-06 21:50:51,292 INFO L78 Accepts]: Start accepts. Automaton has 54230 states and 57896 transitions. Word has length 1111 [2018-11-06 21:50:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:51,293 INFO L480 AbstractCegarLoop]: Abstraction has 54230 states and 57896 transitions. [2018-11-06 21:50:51,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:50:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 54230 states and 57896 transitions. [2018-11-06 21:50:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2018-11-06 21:50:51,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:51,329 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,330 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:51,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:51,330 INFO L82 PathProgramCache]: Analyzing trace with hash -88722940, now seen corresponding path program 1 times [2018-11-06 21:50:51,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:51,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3188 backedges. 1768 proven. 0 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2018-11-06 21:50:52,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:50:52,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:50:52,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:50:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:50:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:50:52,879 INFO L87 Difference]: Start difference. First operand 54230 states and 57896 transitions. Second operand 3 states. [2018-11-06 21:50:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:50:54,938 INFO L93 Difference]: Finished difference Result 102486 states and 109514 transitions. [2018-11-06 21:50:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:50:54,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1253 [2018-11-06 21:50:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:50:54,993 INFO L225 Difference]: With dead ends: 102486 [2018-11-06 21:50:54,993 INFO L226 Difference]: Without dead ends: 55080 [2018-11-06 21:50:55,019 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:50:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55080 states. [2018-11-06 21:50:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55080 to 53376. [2018-11-06 21:50:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53376 states. [2018-11-06 21:50:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53376 states to 53376 states and 56747 transitions. [2018-11-06 21:50:55,519 INFO L78 Accepts]: Start accepts. Automaton has 53376 states and 56747 transitions. Word has length 1253 [2018-11-06 21:50:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:50:55,520 INFO L480 AbstractCegarLoop]: Abstraction has 53376 states and 56747 transitions. [2018-11-06 21:50:55,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:50:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53376 states and 56747 transitions. [2018-11-06 21:50:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-11-06 21:50:55,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:50:55,556 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:50:55,556 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:50:55,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:50:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1221499625, now seen corresponding path program 1 times [2018-11-06 21:50:55,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:50:55,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:50:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:50:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:56,998 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 21:50:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 1345 proven. 346 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-06 21:50:58,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:50:58,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:50:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:50:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:50:58,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:51:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 1027 proven. 573 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2018-11-06 21:51:01,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:51:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-06 21:51:01,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:51:01,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:51:01,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:51:01,631 INFO L87 Difference]: Start difference. First operand 53376 states and 56747 transitions. Second operand 9 states. [2018-11-06 21:51:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:51:23,339 INFO L93 Difference]: Finished difference Result 134941 states and 143475 transitions. [2018-11-06 21:51:23,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:51:23,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1297 [2018-11-06 21:51:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:51:23,414 INFO L225 Difference]: With dead ends: 134941 [2018-11-06 21:51:23,414 INFO L226 Difference]: Without dead ends: 82413 [2018-11-06 21:51:23,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 1304 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:51:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82413 states. [2018-11-06 21:51:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82413 to 69160. [2018-11-06 21:51:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69160 states. [2018-11-06 21:51:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69160 states to 69160 states and 72661 transitions. [2018-11-06 21:51:24,138 INFO L78 Accepts]: Start accepts. Automaton has 69160 states and 72661 transitions. Word has length 1297 [2018-11-06 21:51:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:51:24,139 INFO L480 AbstractCegarLoop]: Abstraction has 69160 states and 72661 transitions. [2018-11-06 21:51:24,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:51:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69160 states and 72661 transitions. [2018-11-06 21:51:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1441 [2018-11-06 21:51:24,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:51:24,189 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:51:24,189 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:51:24,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:51:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1799522894, now seen corresponding path program 1 times [2018-11-06 21:51:24,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:51:24,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:51:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:51:24,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:51:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-06 21:51:25,238 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:51:25,242 INFO L168 Benchmark]: Toolchain (without parser) took 232769.31 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -556.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-06 21:51:25,244 INFO L168 Benchmark]: CDTParser took 0.23 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:51:25,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1534.20 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:51:25,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 531.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -917.2 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:25,246 INFO L168 Benchmark]: Boogie Preprocessor took 312.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:25,246 INFO L168 Benchmark]: RCFGBuilder took 8989.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 476.1 MB). Peak memory consumption was 476.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:51:25,247 INFO L168 Benchmark]: TraceAbstraction took 221393.44 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -295.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:51:25,256 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.23 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 1534.20 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 531.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 793.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -917.2 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 312.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8989.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 476.1 MB). Peak memory consumption was 476.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221393.44 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -295.0 MB). Peak memory consumption was 1.4 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