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/Problem15_label10_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:28:38,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:28:38,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:28:38,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:28:38,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:28:38,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:28:38,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:28:38,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:28:38,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:28:38,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:28:38,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:28:38,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:28:38,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:28:38,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:28:38,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:28:38,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:28:38,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:28:38,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:28:38,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:28:38,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:28:38,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:28:38,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:28:38,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:28:38,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:28:38,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:28:38,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:28:38,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:28:38,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:28:38,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:28:38,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:28:38,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:28:38,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:28:38,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:28:38,660 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:28:38,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:28:38,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:28:38,662 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:28:38,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:28:38,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:28:38,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:28:38,678 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:28:38,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:28:38,679 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:28:38,679 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:28:38,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:28:38,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:28:38,680 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:28:38,680 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:28:38,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:28:38,681 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:28:38,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:28:38,681 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:28:38,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:28:38,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:28:38,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:28:38,682 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:28:38,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:28:38,682 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:28:38,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:28:38,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:28:38,683 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:28:38,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:28:38,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:28:38,684 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:28:38,684 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:28:38,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:28:38,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:28:38,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:28:38,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:28:38,761 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:28:38,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label10_true-unreach-call.c [2018-11-06 21:28:38,834 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a93dd22/9f8ea4ae17734bff9328274719140f12/FLAG448b39594 [2018-11-06 21:28:39,575 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:28:39,576 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label10_true-unreach-call.c [2018-11-06 21:28:39,603 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a93dd22/9f8ea4ae17734bff9328274719140f12/FLAG448b39594 [2018-11-06 21:28:39,627 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a93dd22/9f8ea4ae17734bff9328274719140f12 [2018-11-06 21:28:39,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:28:39,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:28:39,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:28:39,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:28:39,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:28:39,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:28:39" (1/1) ... [2018-11-06 21:28:39,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378b024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:39, skipping insertion in model container [2018-11-06 21:28:39,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:28:39" (1/1) ... [2018-11-06 21:28:39,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:28:39,764 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:28:40,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:28:40,672 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:28:40,965 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:28:40,987 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:28:40,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40 WrapperNode [2018-11-06 21:28:40,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:28:40,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:28:40,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:28:40,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:28:41,003 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:28:40" (1/1) ... [2018-11-06 21:28:41,198 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:28:40" (1/1) ... [2018-11-06 21:28:41,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:28:41,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:28:41,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:28:41,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:28:41,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (1/1) ... [2018-11-06 21:28:41,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:28:41,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:28:41,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:28:41,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:28:41,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (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:28:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:28:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:28:41,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:28:47,735 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:28:47,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:28:47 BoogieIcfgContainer [2018-11-06 21:28:47,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:28:47,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:28:47,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:28:47,740 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:28:47,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:28:39" (1/3) ... [2018-11-06 21:28:47,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fdc0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:28:47, skipping insertion in model container [2018-11-06 21:28:47,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:40" (2/3) ... [2018-11-06 21:28:47,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fdc0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:28:47, skipping insertion in model container [2018-11-06 21:28:47,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:28:47" (3/3) ... [2018-11-06 21:28:47,745 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label10_true-unreach-call.c [2018-11-06 21:28:47,755 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:28:47,764 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:28:47,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:28:47,824 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:28:47,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:28:47,825 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:28:47,825 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:28:47,825 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:28:47,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:28:47,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:28:47,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:28:47,826 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:28:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-11-06 21:28:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-06 21:28:47,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:47,867 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] [2018-11-06 21:28:47,869 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:47,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1433927590, now seen corresponding path program 1 times [2018-11-06 21:28:47,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:47,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:47,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:47,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:47,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:48,328 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-06 21:28:48,338 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:28:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:28:48,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:48,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:48,365 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-11-06 21:28:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:54,735 INFO L93 Difference]: Finished difference Result 1474 states and 2723 transitions. [2018-11-06 21:28:54,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:54,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-06 21:28:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:54,767 INFO L225 Difference]: With dead ends: 1474 [2018-11-06 21:28:54,767 INFO L226 Difference]: Without dead ends: 1042 [2018-11-06 21:28:54,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-11-06 21:28:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1040. [2018-11-06 21:28:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-11-06 21:28:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1638 transitions. [2018-11-06 21:28:54,913 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1638 transitions. Word has length 35 [2018-11-06 21:28:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:54,913 INFO L480 AbstractCegarLoop]: Abstraction has 1040 states and 1638 transitions. [2018-11-06 21:28:54,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1638 transitions. [2018-11-06 21:28:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-06 21:28:54,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:54,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:54,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash 143148094, now seen corresponding path program 1 times [2018-11-06 21:28:54,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:54,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:54,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:28:55,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:55,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:55,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:55,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:55,324 INFO L87 Difference]: Start difference. First operand 1040 states and 1638 transitions. Second operand 4 states. [2018-11-06 21:29:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:01,347 INFO L93 Difference]: Finished difference Result 3887 states and 6230 transitions. [2018-11-06 21:29:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:01,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-06 21:29:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:01,364 INFO L225 Difference]: With dead ends: 3887 [2018-11-06 21:29:01,364 INFO L226 Difference]: Without dead ends: 2849 [2018-11-06 21:29:01,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:29:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2018-11-06 21:29:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2844. [2018-11-06 21:29:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2844 states. [2018-11-06 21:29:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4039 transitions. [2018-11-06 21:29:01,434 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4039 transitions. Word has length 101 [2018-11-06 21:29:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:01,435 INFO L480 AbstractCegarLoop]: Abstraction has 2844 states and 4039 transitions. [2018-11-06 21:29:01,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4039 transitions. [2018-11-06 21:29:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-06 21:29:01,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:01,449 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:29:01,449 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:01,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1603232273, now seen corresponding path program 1 times [2018-11-06 21:29:01,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:01,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 65 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 21:29:01,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:29:01,891 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:29:01,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:02,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:29:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:29:02,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:29:02,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:29:02,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:29:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:29:02,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:02,323 INFO L87 Difference]: Start difference. First operand 2844 states and 4039 transitions. Second operand 4 states. [2018-11-06 21:29:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:07,524 INFO L93 Difference]: Finished difference Result 10857 states and 15533 transitions. [2018-11-06 21:29:07,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:07,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-11-06 21:29:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:07,566 INFO L225 Difference]: With dead ends: 10857 [2018-11-06 21:29:07,567 INFO L226 Difference]: Without dead ends: 8015 [2018-11-06 21:29:07,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8015 states. [2018-11-06 21:29:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8015 to 4646. [2018-11-06 21:29:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4646 states. [2018-11-06 21:29:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4646 states to 4646 states and 6263 transitions. [2018-11-06 21:29:07,688 INFO L78 Accepts]: Start accepts. Automaton has 4646 states and 6263 transitions. Word has length 247 [2018-11-06 21:29:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:07,689 INFO L480 AbstractCegarLoop]: Abstraction has 4646 states and 6263 transitions. [2018-11-06 21:29:07,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4646 states and 6263 transitions. [2018-11-06 21:29:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-06 21:29:07,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:07,698 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:29:07,698 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:07,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1545197573, now seen corresponding path program 1 times [2018-11-06 21:29:07,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:07,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:07,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:07,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:08,478 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-06 21:29:08,849 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:29:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-06 21:29:09,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:09,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:29:09,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:29:09,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:29:09,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:29:09,210 INFO L87 Difference]: Start difference. First operand 4646 states and 6263 transitions. Second operand 5 states. [2018-11-06 21:29:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:13,482 INFO L93 Difference]: Finished difference Result 11092 states and 14512 transitions. [2018-11-06 21:29:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:13,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 315 [2018-11-06 21:29:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:13,510 INFO L225 Difference]: With dead ends: 11092 [2018-11-06 21:29:13,510 INFO L226 Difference]: Without dead ends: 6448 [2018-11-06 21:29:13,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:29:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2018-11-06 21:29:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 6147. [2018-11-06 21:29:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2018-11-06 21:29:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7862 transitions. [2018-11-06 21:29:13,621 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7862 transitions. Word has length 315 [2018-11-06 21:29:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:13,622 INFO L480 AbstractCegarLoop]: Abstraction has 6147 states and 7862 transitions. [2018-11-06 21:29:13,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:29:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7862 transitions. [2018-11-06 21:29:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-06 21:29:13,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:13,633 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:29:13,633 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:13,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1783853203, now seen corresponding path program 1 times [2018-11-06 21:29:13,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:13,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:29:14,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:14,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:29:14,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:29:14,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:29:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:14,227 INFO L87 Difference]: Start difference. First operand 6147 states and 7862 transitions. Second operand 4 states. [2018-11-06 21:29:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:17,895 INFO L93 Difference]: Finished difference Result 15298 states and 20011 transitions. [2018-11-06 21:29:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:17,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2018-11-06 21:29:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:17,933 INFO L225 Difference]: With dead ends: 15298 [2018-11-06 21:29:17,934 INFO L226 Difference]: Without dead ends: 9153 [2018-11-06 21:29:17,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:29:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states. [2018-11-06 21:29:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 9150. [2018-11-06 21:29:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9150 states. [2018-11-06 21:29:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9150 states to 9150 states and 11448 transitions. [2018-11-06 21:29:18,181 INFO L78 Accepts]: Start accepts. Automaton has 9150 states and 11448 transitions. Word has length 389 [2018-11-06 21:29:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:18,182 INFO L480 AbstractCegarLoop]: Abstraction has 9150 states and 11448 transitions. [2018-11-06 21:29:18,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 9150 states and 11448 transitions. [2018-11-06 21:29:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-06 21:29:18,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:18,197 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:18,197 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash -140913389, now seen corresponding path program 1 times [2018-11-06 21:29:18,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:18,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:18,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:18,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 384 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-06 21:29:19,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:29:19,378 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:29:19,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:19,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:29:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-06 21:29:19,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:29:19,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 21:29:19,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:29:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:29:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:29:19,724 INFO L87 Difference]: Start difference. First operand 9150 states and 11448 transitions. Second operand 8 states. [2018-11-06 21:29:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:27,976 INFO L93 Difference]: Finished difference Result 22668 states and 27579 transitions. [2018-11-06 21:29:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:29:27,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 465 [2018-11-06 21:29:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:27,999 INFO L225 Difference]: With dead ends: 22668 [2018-11-06 21:29:28,000 INFO L226 Difference]: Without dead ends: 9445 [2018-11-06 21:29:28,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:29:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9445 states. [2018-11-06 21:29:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9445 to 9145. [2018-11-06 21:29:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9145 states. [2018-11-06 21:29:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9145 states to 9145 states and 10683 transitions. [2018-11-06 21:29:28,140 INFO L78 Accepts]: Start accepts. Automaton has 9145 states and 10683 transitions. Word has length 465 [2018-11-06 21:29:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:28,141 INFO L480 AbstractCegarLoop]: Abstraction has 9145 states and 10683 transitions. [2018-11-06 21:29:28,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:29:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 9145 states and 10683 transitions. [2018-11-06 21:29:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-11-06 21:29:28,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:28,158 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:29:28,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:28,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1737612351, now seen corresponding path program 1 times [2018-11-06 21:29:28,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:28,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:28,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:28,771 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:29:29,126 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-11-06 21:29:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 264 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-06 21:29:30,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:29:30,165 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:29:30,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:30,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:29:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 21:29:30,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:29:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 21:29:30,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:29:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:29:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:29:30,663 INFO L87 Difference]: Start difference. First operand 9145 states and 10683 transitions. Second operand 9 states. [2018-11-06 21:29:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:39,290 INFO L93 Difference]: Finished difference Result 18706 states and 21787 transitions. [2018-11-06 21:29:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:29:39,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 541 [2018-11-06 21:29:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:39,308 INFO L225 Difference]: With dead ends: 18706 [2018-11-06 21:29:39,309 INFO L226 Difference]: Without dead ends: 9563 [2018-11-06 21:29:39,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 545 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:29:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9563 states. [2018-11-06 21:29:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9563 to 9141. [2018-11-06 21:29:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9141 states. [2018-11-06 21:29:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9141 states to 9141 states and 10091 transitions. [2018-11-06 21:29:39,438 INFO L78 Accepts]: Start accepts. Automaton has 9141 states and 10091 transitions. Word has length 541 [2018-11-06 21:29:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:39,439 INFO L480 AbstractCegarLoop]: Abstraction has 9141 states and 10091 transitions. [2018-11-06 21:29:39,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:29:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9141 states and 10091 transitions. [2018-11-06 21:29:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-11-06 21:29:39,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:39,449 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:39,449 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:39,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -3299966, now seen corresponding path program 1 times [2018-11-06 21:29:39,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:39,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:29:40,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:29:40,418 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:29:40,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:40,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:29:40,947 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2018-11-06 21:29:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:29:41,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:29:41,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-06 21:29:41,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:29:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:29:41,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:29:41,897 INFO L87 Difference]: Start difference. First operand 9141 states and 10091 transitions. Second operand 7 states. [2018-11-06 21:29:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:51,456 INFO L93 Difference]: Finished difference Result 35300 states and 39221 transitions. [2018-11-06 21:29:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:29:51,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 579 [2018-11-06 21:29:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:51,501 INFO L225 Difference]: With dead ends: 35300 [2018-11-06 21:29:51,502 INFO L226 Difference]: Without dead ends: 26161 [2018-11-06 21:29:51,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:29:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26161 states. [2018-11-06 21:29:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26161 to 14285. [2018-11-06 21:29:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14285 states. [2018-11-06 21:29:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14285 states to 14285 states and 15414 transitions. [2018-11-06 21:29:51,790 INFO L78 Accepts]: Start accepts. Automaton has 14285 states and 15414 transitions. Word has length 579 [2018-11-06 21:29:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:51,791 INFO L480 AbstractCegarLoop]: Abstraction has 14285 states and 15414 transitions. [2018-11-06 21:29:51,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:29:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14285 states and 15414 transitions. [2018-11-06 21:29:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-11-06 21:29:51,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:51,805 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:51,805 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:51,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash 401016699, now seen corresponding path program 1 times [2018-11-06 21:29:51,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:51,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:51,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:51,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:51,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-06 21:29:52,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:52,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:29:52,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:29:52,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:29:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:52,633 INFO L87 Difference]: Start difference. First operand 14285 states and 15414 transitions. Second operand 4 states. [2018-11-06 21:29:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:57,559 INFO L93 Difference]: Finished difference Result 42716 states and 46241 transitions. [2018-11-06 21:29:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:57,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2018-11-06 21:29:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:57,610 INFO L225 Difference]: With dead ends: 42716 [2018-11-06 21:29:57,611 INFO L226 Difference]: Without dead ends: 28733 [2018-11-06 21:29:57,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28733 states. [2018-11-06 21:29:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28733 to 23282. [2018-11-06 21:29:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23282 states. [2018-11-06 21:29:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23282 states to 23282 states and 25083 transitions. [2018-11-06 21:29:57,961 INFO L78 Accepts]: Start accepts. Automaton has 23282 states and 25083 transitions. Word has length 600 [2018-11-06 21:29:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:57,962 INFO L480 AbstractCegarLoop]: Abstraction has 23282 states and 25083 transitions. [2018-11-06 21:29:57,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23282 states and 25083 transitions. [2018-11-06 21:29:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-11-06 21:29:57,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:57,991 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:29:57,991 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:57,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -454982086, now seen corresponding path program 1 times [2018-11-06 21:29:57,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:57,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:57,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:57,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:58,959 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:30:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 98 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:01,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:01,138 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:30:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:01,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:02,086 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 21:30:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 475 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:03,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:30:03,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 19 [2018-11-06 21:30:03,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-06 21:30:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-06 21:30:03,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-06 21:30:03,361 INFO L87 Difference]: Start difference. First operand 23282 states and 25083 transitions. Second operand 19 states. [2018-11-06 21:30:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:29,350 INFO L93 Difference]: Finished difference Result 81933 states and 88011 transitions. [2018-11-06 21:30:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-06 21:30:29,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 707 [2018-11-06 21:30:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:29,448 INFO L225 Difference]: With dead ends: 81933 [2018-11-06 21:30:29,448 INFO L226 Difference]: Without dead ends: 59253 [2018-11-06 21:30:29,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 722 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2018-11-06 21:30:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59253 states. [2018-11-06 21:30:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59253 to 35680. [2018-11-06 21:30:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35680 states. [2018-11-06 21:30:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35680 states to 35680 states and 37896 transitions. [2018-11-06 21:30:30,087 INFO L78 Accepts]: Start accepts. Automaton has 35680 states and 37896 transitions. Word has length 707 [2018-11-06 21:30:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:30,088 INFO L480 AbstractCegarLoop]: Abstraction has 35680 states and 37896 transitions. [2018-11-06 21:30:30,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-06 21:30:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 35680 states and 37896 transitions. [2018-11-06 21:30:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-11-06 21:30:30,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:30,151 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:30:30,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:30,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2144904263, now seen corresponding path program 1 times [2018-11-06 21:30:30,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:30,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:30,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:31,058 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:30:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 132 proven. 814 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-06 21:30:33,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:33,750 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:30:33,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:33,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-06 21:30:34,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:30:34,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-11-06 21:30:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:30:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:30:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:30:34,578 INFO L87 Difference]: Start difference. First operand 35680 states and 37896 transitions. Second operand 11 states. [2018-11-06 21:30:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:41,944 INFO L93 Difference]: Finished difference Result 71672 states and 76160 transitions. [2018-11-06 21:30:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:30:41,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 881 [2018-11-06 21:30:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:41,982 INFO L225 Difference]: With dead ends: 71672 [2018-11-06 21:30:41,982 INFO L226 Difference]: Without dead ends: 38394 [2018-11-06 21:30:42,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 890 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:30:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38394 states. [2018-11-06 21:30:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38394 to 33252. [2018-11-06 21:30:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33252 states. [2018-11-06 21:30:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33252 states to 33252 states and 34913 transitions. [2018-11-06 21:30:42,517 INFO L78 Accepts]: Start accepts. Automaton has 33252 states and 34913 transitions. Word has length 881 [2018-11-06 21:30:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:42,518 INFO L480 AbstractCegarLoop]: Abstraction has 33252 states and 34913 transitions. [2018-11-06 21:30:42,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:30:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33252 states and 34913 transitions. [2018-11-06 21:30:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2018-11-06 21:30:42,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:42,553 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:30:42,554 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:42,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1691702732, now seen corresponding path program 1 times [2018-11-06 21:30:42,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 131 proven. 568 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 21:30:44,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:44,914 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:30:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:45,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:45,522 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-11-06 21:30:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 21:30:47,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:30:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:30:47,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:30:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:30:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:30:47,592 INFO L87 Difference]: Start difference. First operand 33252 states and 34913 transitions. Second operand 7 states. [2018-11-06 21:30:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:53,359 INFO L93 Difference]: Finished difference Result 82929 states and 87321 transitions. [2018-11-06 21:30:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:30:53,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 900 [2018-11-06 21:30:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:53,393 INFO L225 Difference]: With dead ends: 82929 [2018-11-06 21:30:53,393 INFO L226 Difference]: Without dead ends: 37337 [2018-11-06 21:30:53,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:30:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37337 states. [2018-11-06 21:30:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37337 to 20823. [2018-11-06 21:30:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20823 states. [2018-11-06 21:30:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20823 states to 20823 states and 21643 transitions. [2018-11-06 21:30:53,794 INFO L78 Accepts]: Start accepts. Automaton has 20823 states and 21643 transitions. Word has length 900 [2018-11-06 21:30:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:53,794 INFO L480 AbstractCegarLoop]: Abstraction has 20823 states and 21643 transitions. [2018-11-06 21:30:53,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:30:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 20823 states and 21643 transitions. [2018-11-06 21:30:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2018-11-06 21:30:53,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:53,812 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:30:53,812 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:53,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash -301869567, now seen corresponding path program 1 times [2018-11-06 21:30:53,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:53,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 736 proven. 33 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2018-11-06 21:30:57,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:57,239 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:30:57,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:57,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 736 proven. 33 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2018-11-06 21:30:58,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:30:58,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-11-06 21:30:58,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 21:30:58,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 21:30:58,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:30:58,548 INFO L87 Difference]: Start difference. First operand 20823 states and 21643 transitions. Second operand 16 states. [2018-11-06 21:30:58,713 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-06 21:30:59,848 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-11-06 21:31:05,139 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-11-06 21:31:08,939 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-06 21:31:09,823 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-11-06 21:31:10,927 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-06 21:31:19,054 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-06 21:31:22,845 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-06 21:31:24,352 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-11-06 21:31:24,631 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-11-06 21:31:26,128 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-11-06 21:31:29,449 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-06 21:31:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:31,797 INFO L93 Difference]: Finished difference Result 62443 states and 64779 transitions. [2018-11-06 21:31:31,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-06 21:31:31,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 972 [2018-11-06 21:31:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:31,838 INFO L225 Difference]: With dead ends: 62443 [2018-11-06 21:31:31,838 INFO L226 Difference]: Without dead ends: 41912 [2018-11-06 21:31:31,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1108 GetRequests, 1009 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3896 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1931, Invalid=8169, Unknown=0, NotChecked=0, Total=10100 [2018-11-06 21:31:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41912 states. [2018-11-06 21:31:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41912 to 25941. [2018-11-06 21:31:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25941 states. [2018-11-06 21:31:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25941 states to 25941 states and 26865 transitions. [2018-11-06 21:31:32,220 INFO L78 Accepts]: Start accepts. Automaton has 25941 states and 26865 transitions. Word has length 972 [2018-11-06 21:31:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:32,221 INFO L480 AbstractCegarLoop]: Abstraction has 25941 states and 26865 transitions. [2018-11-06 21:31:32,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 21:31:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25941 states and 26865 transitions. [2018-11-06 21:31:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2018-11-06 21:31:32,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:32,246 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:31:32,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:32,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1261034056, now seen corresponding path program 1 times [2018-11-06 21:31:32,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:32,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:32,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2064 backedges. 1340 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2018-11-06 21:31:33,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:33,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:31:33,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:31:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:31:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:33,491 INFO L87 Difference]: Start difference. First operand 25941 states and 26865 transitions. Second operand 3 states. [2018-11-06 21:31:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:35,394 INFO L93 Difference]: Finished difference Result 53077 states and 54977 transitions. [2018-11-06 21:31:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:31:35,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1076 [2018-11-06 21:31:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:35,415 INFO L225 Difference]: With dead ends: 53077 [2018-11-06 21:31:35,415 INFO L226 Difference]: Without dead ends: 21092 [2018-11-06 21:31:35,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:31:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21092 states. [2018-11-06 21:31:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21092 to 18391. [2018-11-06 21:31:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18391 states. [2018-11-06 21:31:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18391 states to 18391 states and 18863 transitions. [2018-11-06 21:31:35,826 INFO L78 Accepts]: Start accepts. Automaton has 18391 states and 18863 transitions. Word has length 1076 [2018-11-06 21:31:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:35,826 INFO L480 AbstractCegarLoop]: Abstraction has 18391 states and 18863 transitions. [2018-11-06 21:31:35,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:31:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18391 states and 18863 transitions. [2018-11-06 21:31:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-11-06 21:31:35,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:35,852 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:31:35,852 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:35,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1592615012, now seen corresponding path program 1 times [2018-11-06 21:31:35,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:35,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1783 backedges. 1132 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-11-06 21:31:36,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:36,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:31:36,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:31:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:31:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:36,892 INFO L87 Difference]: Start difference. First operand 18391 states and 18863 transitions. Second operand 3 states. [2018-11-06 21:31:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:38,091 INFO L93 Difference]: Finished difference Result 29531 states and 30266 transitions. [2018-11-06 21:31:38,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:31:38,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1094 [2018-11-06 21:31:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:38,104 INFO L225 Difference]: With dead ends: 29531 [2018-11-06 21:31:38,104 INFO L226 Difference]: Without dead ends: 13242 [2018-11-06 21:31:38,112 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:31:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2018-11-06 21:31:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 12642. [2018-11-06 21:31:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12642 states. [2018-11-06 21:31:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12642 states to 12642 states and 12858 transitions. [2018-11-06 21:31:38,261 INFO L78 Accepts]: Start accepts. Automaton has 12642 states and 12858 transitions. Word has length 1094 [2018-11-06 21:31:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:38,261 INFO L480 AbstractCegarLoop]: Abstraction has 12642 states and 12858 transitions. [2018-11-06 21:31:38,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:31:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 12642 states and 12858 transitions. [2018-11-06 21:31:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2018-11-06 21:31:38,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:38,273 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,274 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:38,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1640094595, now seen corresponding path program 1 times [2018-11-06 21:31:38,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:38,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:38,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1798 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-11-06 21:31:39,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:31:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:31:39,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:31:39,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:39,464 INFO L87 Difference]: Start difference. First operand 12642 states and 12858 transitions. Second operand 3 states. [2018-11-06 21:31:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:40,830 INFO L93 Difference]: Finished difference Result 25588 states and 26030 transitions. [2018-11-06 21:31:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:31:40,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1104 [2018-11-06 21:31:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:40,845 INFO L225 Difference]: With dead ends: 25588 [2018-11-06 21:31:40,845 INFO L226 Difference]: Without dead ends: 15048 [2018-11-06 21:31:40,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2018-11-06 21:31:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 13842. [2018-11-06 21:31:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13842 states. [2018-11-06 21:31:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13842 states to 13842 states and 14075 transitions. [2018-11-06 21:31:41,025 INFO L78 Accepts]: Start accepts. Automaton has 13842 states and 14075 transitions. Word has length 1104 [2018-11-06 21:31:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:41,026 INFO L480 AbstractCegarLoop]: Abstraction has 13842 states and 14075 transitions. [2018-11-06 21:31:41,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:31:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13842 states and 14075 transitions. [2018-11-06 21:31:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2018-11-06 21:31:41,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:41,039 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:31:41,040 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:41,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1774140287, now seen corresponding path program 1 times [2018-11-06 21:31:41,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:41,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:41,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:41,850 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:31:42,460 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-11-06 21:31:42,681 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-11-06 21:31:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 1626 proven. 213 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-06 21:31:44,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:31:44,357 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:31:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:44,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:31:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 1766 proven. 2 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-11-06 21:31:45,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:31:45,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2018-11-06 21:31:45,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 21:31:45,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 21:31:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:31:45,994 INFO L87 Difference]: Start difference. First operand 13842 states and 14075 transitions. Second operand 14 states. [2018-11-06 21:31:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:52,510 INFO L93 Difference]: Finished difference Result 26130 states and 26569 transitions. [2018-11-06 21:31:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-06 21:31:52,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1142 [2018-11-06 21:31:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:52,522 INFO L225 Difference]: With dead ends: 26130 [2018-11-06 21:31:52,522 INFO L226 Difference]: Without dead ends: 13462 [2018-11-06 21:31:52,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1150 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-11-06 21:31:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13462 states. [2018-11-06 21:31:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13462 to 13236. [2018-11-06 21:31:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13236 states. [2018-11-06 21:31:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13236 states to 13236 states and 13446 transitions. [2018-11-06 21:31:52,700 INFO L78 Accepts]: Start accepts. Automaton has 13236 states and 13446 transitions. Word has length 1142 [2018-11-06 21:31:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:52,701 INFO L480 AbstractCegarLoop]: Abstraction has 13236 states and 13446 transitions. [2018-11-06 21:31:52,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 21:31:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13236 states and 13446 transitions. [2018-11-06 21:31:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2018-11-06 21:31:52,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:52,717 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:31:52,717 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:52,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1425205259, now seen corresponding path program 1 times [2018-11-06 21:31:52,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:52,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:52,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:52,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:52,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:54,174 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:31:54,805 WARN L179 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-06 21:31:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2151 backedges. 978 proven. 33 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2018-11-06 21:31:57,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:31:57,432 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:31:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:57,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:31:58,291 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-11-06 21:31:58,643 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-06 21:32:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2151 backedges. 987 proven. 24 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2018-11-06 21:32:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:32:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2018-11-06 21:32:00,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-06 21:32:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-06 21:32:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-06 21:32:00,792 INFO L87 Difference]: Start difference. First operand 13236 states and 13446 transitions. Second operand 15 states. [2018-11-06 21:32:10,434 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-06 21:32:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:16,304 INFO L93 Difference]: Finished difference Result 30340 states and 30810 transitions. [2018-11-06 21:32:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-06 21:32:16,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1148 [2018-11-06 21:32:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:16,321 INFO L225 Difference]: With dead ends: 30340 [2018-11-06 21:32:16,321 INFO L226 Difference]: Without dead ends: 18595 [2018-11-06 21:32:16,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1165 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=608, Invalid=1744, Unknown=0, NotChecked=0, Total=2352 [2018-11-06 21:32:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18595 states. [2018-11-06 21:32:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18595 to 12935. [2018-11-06 21:32:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12935 states. [2018-11-06 21:32:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12935 states to 12935 states and 13136 transitions. [2018-11-06 21:32:16,520 INFO L78 Accepts]: Start accepts. Automaton has 12935 states and 13136 transitions. Word has length 1148 [2018-11-06 21:32:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:16,521 INFO L480 AbstractCegarLoop]: Abstraction has 12935 states and 13136 transitions. [2018-11-06 21:32:16,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-06 21:32:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 12935 states and 13136 transitions. [2018-11-06 21:32:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1227 [2018-11-06 21:32:16,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:16,536 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:32:16,537 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:16,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash 950913102, now seen corresponding path program 1 times [2018-11-06 21:32:16,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:16,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:17,813 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:32:18,043 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-06 21:32:18,630 WARN L179 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-06 21:32:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2075 backedges. 1390 proven. 249 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2018-11-06 21:32:23,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:32:23,318 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:32:23,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:23,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:32:26,250 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2018-11-06 21:32:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2075 backedges. 1573 proven. 66 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2018-11-06 21:32:28,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:32:28,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2018-11-06 21:32:28,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-06 21:32:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-06 21:32:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-11-06 21:32:28,564 INFO L87 Difference]: Start difference. First operand 12935 states and 13136 transitions. Second operand 23 states. Received shutdown request... [2018-11-06 21:32:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:32:28,929 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:32:28,936 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:32:28,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:32:28 BoogieIcfgContainer [2018-11-06 21:32:28,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:32:28,937 INFO L168 Benchmark]: Toolchain (without parser) took 229295.48 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 1.5 GB in the end (delta: -146.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:32:28,938 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:32:28,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1344.06 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:32:28,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 408.01 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 680.0 MB). Free memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: -792.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:32:28,941 INFO L168 Benchmark]: Boogie Preprocessor took 258.35 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:32:28,941 INFO L168 Benchmark]: RCFGBuilder took 6079.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 299.9 MB). Peak memory consumption was 299.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:32:28,942 INFO L168 Benchmark]: TraceAbstraction took 221199.08 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 1.5 GB in the end (delta: 196.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:32:28,947 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1344.06 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 408.01 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 680.0 MB). Free memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: -792.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 258.35 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6079.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 299.9 MB). Peak memory consumption was 299.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221199.08 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 1.5 GB in the end (delta: 196.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 109). Cancelled while BasicCegarLoop was constructing difference of abstraction (12935states) and FLOYD_HOARE automaton (currently 4 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 221.1s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 156.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4146 SDtfs, 53211 SDslu, 4884 SDs, 0 SdLazy, 89925 SolverSat, 12611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 119.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9238 GetRequests, 8907 SyntacticMatches, 37 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5335 ImplicationChecksByTransitivity, 26.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35680occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 93322 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 34.8s InterpolantComputationTime, 22330 NumberOfCodeBlocks, 22330 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 22300 ConstructedInterpolants, 876 QuantifiedInterpolants, 130552680 SizeOfPredicates, 27 NumberOfNonLiveVariables, 10220 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 30 InterpolantComputations, 13 PerfectInterpolantSequences, 26917/29885 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown