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_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:29:54,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:29:54,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:29:54,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:29:54,794 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:29:54,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:29:54,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:29:54,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:29:54,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:29:54,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:29:54,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:29:54,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:29:54,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:29:54,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:29:54,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:29:54,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:29:54,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:29:54,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:29:54,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:29:54,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:29:54,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:29:54,838 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:29:54,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:29:54,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:29:54,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:29:54,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:29:54,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:29:54,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:29:54,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:29:54,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:29:54,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:29:54,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:29:54,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:29:54,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:29:54,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:29:54,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:29:54,856 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:29:54,885 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:29:54,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:29:54,886 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:29:54,887 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:29:54,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:29:54,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:29:54,889 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:29:54,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:29:54,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:29:54,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:29:54,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:29:54,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:29:54,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:29:54,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:29:54,890 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:29:54,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:29:54,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:29:54,891 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:29:54,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:29:54,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:29:54,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:29:54,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:29:54,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:29:54,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:29:54,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:29:54,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:29:54,892 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:29:54,893 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:29:54,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:29:54,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:29:54,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:29:54,962 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:29:54,962 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:29:54,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label19_true-unreach-call.c [2018-11-06 21:29:55,022 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2cecd43e/d63e4003a537434682df126457c0c218/FLAGff3f851ca [2018-11-06 21:29:55,652 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:29:55,653 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label19_true-unreach-call.c [2018-11-06 21:29:55,677 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2cecd43e/d63e4003a537434682df126457c0c218/FLAGff3f851ca [2018-11-06 21:29:55,699 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2cecd43e/d63e4003a537434682df126457c0c218 [2018-11-06 21:29:55,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:29:55,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:29:55,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:29:55,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:29:55,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:29:55,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:29:55" (1/1) ... [2018-11-06 21:29:55,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a881964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:55, skipping insertion in model container [2018-11-06 21:29:55,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:29:55" (1/1) ... [2018-11-06 21:29:55,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:29:55,859 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:29:56,682 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:29:56,686 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:29:56,969 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:29:56,992 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:29:56,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56 WrapperNode [2018-11-06 21:29:56,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:29:56,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:29:56,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:29:56,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:29:57,005 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:29:56" (1/1) ... [2018-11-06 21:29:57,240 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:29:56" (1/1) ... [2018-11-06 21:29:57,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:29:57,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:29:57,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:29:57,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:29:57,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (1/1) ... [2018-11-06 21:29:57,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:29:57,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:29:57,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:29:57,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:29:57,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (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:29:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:29:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:29:57,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:30:03,952 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:30:03,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:30:03 BoogieIcfgContainer [2018-11-06 21:30:03,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:30:03,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:30:03,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:30:03,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:30:03,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:29:55" (1/3) ... [2018-11-06 21:30:03,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c7bee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:30:03, skipping insertion in model container [2018-11-06 21:30:03,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:56" (2/3) ... [2018-11-06 21:30:03,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c7bee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:30:03, skipping insertion in model container [2018-11-06 21:30:03,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:30:03" (3/3) ... [2018-11-06 21:30:03,962 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label19_true-unreach-call.c [2018-11-06 21:30:03,971 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:30:03,979 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:30:03,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:30:04,036 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:30:04,037 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:30:04,037 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:30:04,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:30:04,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:30:04,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:30:04,038 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:30:04,038 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:30:04,038 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:30:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-11-06 21:30:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-06 21:30:04,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:04,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:30:04,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:04,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 279835594, now seen corresponding path program 1 times [2018-11-06 21:30:04,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:04,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:04,541 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-06 21:30:04,557 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:30:04,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:04,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:30:04,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:30:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:04,588 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-11-06 21:30:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:11,087 INFO L93 Difference]: Finished difference Result 1518 states and 2794 transitions. [2018-11-06 21:30:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:11,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-06 21:30:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:11,121 INFO L225 Difference]: With dead ends: 1518 [2018-11-06 21:30:11,121 INFO L226 Difference]: Without dead ends: 1086 [2018-11-06 21:30:11,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2018-11-06 21:30:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 739. [2018-11-06 21:30:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-11-06 21:30:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1331 transitions. [2018-11-06 21:30:11,229 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1331 transitions. Word has length 46 [2018-11-06 21:30:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:11,229 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 1331 transitions. [2018-11-06 21:30:11,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:30:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1331 transitions. [2018-11-06 21:30:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-06 21:30:11,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:11,236 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:30:11,236 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:11,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1128912517, now seen corresponding path program 1 times [2018-11-06 21:30:11,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:11,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:11,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:11,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:30:11,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:30:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:30:11,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:30:11,615 INFO L87 Difference]: Start difference. First operand 739 states and 1331 transitions. Second operand 5 states. [2018-11-06 21:30:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:21,623 INFO L93 Difference]: Finished difference Result 2460 states and 4483 transitions. [2018-11-06 21:30:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:30:21,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2018-11-06 21:30:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:21,636 INFO L225 Difference]: With dead ends: 2460 [2018-11-06 21:30:21,636 INFO L226 Difference]: Without dead ends: 1723 [2018-11-06 21:30:21,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:30:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-06 21:30:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1052. [2018-11-06 21:30:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-11-06 21:30:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1780 transitions. [2018-11-06 21:30:21,680 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1780 transitions. Word has length 112 [2018-11-06 21:30:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:21,680 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1780 transitions. [2018-11-06 21:30:21,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:30:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1780 transitions. [2018-11-06 21:30:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-06 21:30:21,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:21,685 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:30:21,685 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:21,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1432151457, now seen corresponding path program 1 times [2018-11-06 21:30:21,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:21,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:21,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:21,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:21,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:21,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:30:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:30:21,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:21,834 INFO L87 Difference]: Start difference. First operand 1052 states and 1780 transitions. Second operand 4 states. [2018-11-06 21:30:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:25,997 INFO L93 Difference]: Finished difference Result 3969 states and 6821 transitions. [2018-11-06 21:30:25,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:25,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-11-06 21:30:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:26,014 INFO L225 Difference]: With dead ends: 3969 [2018-11-06 21:30:26,015 INFO L226 Difference]: Without dead ends: 2919 [2018-11-06 21:30:26,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2018-11-06 21:30:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1952. [2018-11-06 21:30:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2018-11-06 21:30:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2939 transitions. [2018-11-06 21:30:26,068 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2939 transitions. Word has length 113 [2018-11-06 21:30:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:26,069 INFO L480 AbstractCegarLoop]: Abstraction has 1952 states and 2939 transitions. [2018-11-06 21:30:26,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:30:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2939 transitions. [2018-11-06 21:30:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-06 21:30:26,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:26,079 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,079 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:26,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash 963376405, now seen corresponding path program 1 times [2018-11-06 21:30:26,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:26,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:26,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:26,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:26,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:26,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:26,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:26,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:30:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:30:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:26,446 INFO L87 Difference]: Start difference. First operand 1952 states and 2939 transitions. Second operand 4 states. [2018-11-06 21:30:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:30,109 INFO L93 Difference]: Finished difference Result 7512 states and 11402 transitions. [2018-11-06 21:30:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:30,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-11-06 21:30:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:30,142 INFO L225 Difference]: With dead ends: 7512 [2018-11-06 21:30:30,142 INFO L226 Difference]: Without dead ends: 5562 [2018-11-06 21:30:30,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-11-06 21:30:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5557. [2018-11-06 21:30:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5557 states. [2018-11-06 21:30:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 7561 transitions. [2018-11-06 21:30:30,248 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 7561 transitions. Word has length 117 [2018-11-06 21:30:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:30,249 INFO L480 AbstractCegarLoop]: Abstraction has 5557 states and 7561 transitions. [2018-11-06 21:30:30,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:30:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 7561 transitions. [2018-11-06 21:30:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-06 21:30:30,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:30,252 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,252 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:30,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1070603446, now seen corresponding path program 1 times [2018-11-06 21:30:30,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:30,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:30,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:30,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:30,660 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:30,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:30,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:31,162 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 16 [2018-11-06 21:30:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:30:31,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:30:31,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:30:31,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:30:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:30:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:30:31,484 INFO L87 Difference]: Start difference. First operand 5557 states and 7561 transitions. Second operand 7 states. [2018-11-06 21:30:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:41,956 INFO L93 Difference]: Finished difference Result 30094 states and 41019 transitions. [2018-11-06 21:30:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:30:41,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2018-11-06 21:30:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:42,052 INFO L225 Difference]: With dead ends: 30094 [2018-11-06 21:30:42,054 INFO L226 Difference]: Without dead ends: 16379 [2018-11-06 21:30:42,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:30:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16379 states. [2018-11-06 21:30:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16379 to 12745. [2018-11-06 21:30:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12745 states. [2018-11-06 21:30:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12745 states to 12745 states and 15006 transitions. [2018-11-06 21:30:42,506 INFO L78 Accepts]: Start accepts. Automaton has 12745 states and 15006 transitions. Word has length 138 [2018-11-06 21:30:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:42,507 INFO L480 AbstractCegarLoop]: Abstraction has 12745 states and 15006 transitions. [2018-11-06 21:30:42,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:30:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12745 states and 15006 transitions. [2018-11-06 21:30:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-06 21:30:42,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:42,516 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:30:42,517 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:42,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:42,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1154592654, now seen corresponding path program 1 times [2018-11-06 21:30:42,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:42,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:42,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:42,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:43,128 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-06 21:30:43,491 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:30:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:30:43,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:43,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:30:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:30:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:30:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:30:43,909 INFO L87 Difference]: Start difference. First operand 12745 states and 15006 transitions. Second operand 5 states. [2018-11-06 21:30:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:46,073 INFO L93 Difference]: Finished difference Result 26090 states and 30665 transitions. [2018-11-06 21:30:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:46,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 366 [2018-11-06 21:30:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:46,114 INFO L225 Difference]: With dead ends: 26090 [2018-11-06 21:30:46,114 INFO L226 Difference]: Without dead ends: 13647 [2018-11-06 21:30:46,130 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:30:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13647 states. [2018-11-06 21:30:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13647 to 13645. [2018-11-06 21:30:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13645 states. [2018-11-06 21:30:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13645 states to 13645 states and 15917 transitions. [2018-11-06 21:30:46,323 INFO L78 Accepts]: Start accepts. Automaton has 13645 states and 15917 transitions. Word has length 366 [2018-11-06 21:30:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:46,324 INFO L480 AbstractCegarLoop]: Abstraction has 13645 states and 15917 transitions. [2018-11-06 21:30:46,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:30:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13645 states and 15917 transitions. [2018-11-06 21:30:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-11-06 21:30:46,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:46,334 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:30:46,334 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:46,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1318856182, now seen corresponding path program 1 times [2018-11-06 21:30:46,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:46,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:46,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 21:30:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:30:46,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:30:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:30:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:46,910 INFO L87 Difference]: Start difference. First operand 13645 states and 15917 transitions. Second operand 4 states. [2018-11-06 21:30:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:50,020 INFO L93 Difference]: Finished difference Result 26691 states and 31234 transitions. [2018-11-06 21:30:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:50,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 425 [2018-11-06 21:30:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:50,045 INFO L225 Difference]: With dead ends: 26691 [2018-11-06 21:30:50,045 INFO L226 Difference]: Without dead ends: 13348 [2018-11-06 21:30:50,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13348 states. [2018-11-06 21:30:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13348 to 13041. [2018-11-06 21:30:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13041 states. [2018-11-06 21:30:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13041 states to 13041 states and 14341 transitions. [2018-11-06 21:30:50,238 INFO L78 Accepts]: Start accepts. Automaton has 13041 states and 14341 transitions. Word has length 425 [2018-11-06 21:30:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:50,239 INFO L480 AbstractCegarLoop]: Abstraction has 13041 states and 14341 transitions. [2018-11-06 21:30:50,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:30:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 13041 states and 14341 transitions. [2018-11-06 21:30:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-11-06 21:30:50,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:50,259 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,259 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:50,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1483339877, now seen corresponding path program 1 times [2018-11-06 21:30:50,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:50,960 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:30:51,514 WARN L179 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-11-06 21:30:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 289 proven. 71 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-06 21:30:52,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:52,066 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:30:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:52,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-06 21:30:52,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:30:52,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 21:30:52,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:30:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:30:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:30:52,603 INFO L87 Difference]: Start difference. First operand 13041 states and 14341 transitions. Second operand 9 states. [2018-11-06 21:30:53,801 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 7 [2018-11-06 21:31:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:01,319 INFO L93 Difference]: Finished difference Result 36553 states and 40823 transitions. [2018-11-06 21:31:01,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 21:31:01,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 510 [2018-11-06 21:31:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:01,360 INFO L225 Difference]: With dead ends: 36553 [2018-11-06 21:31:01,360 INFO L226 Difference]: Without dead ends: 23814 [2018-11-06 21:31:01,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 517 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:31:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-11-06 21:31:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 21139. [2018-11-06 21:31:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21139 states. [2018-11-06 21:31:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21139 states to 21139 states and 22998 transitions. [2018-11-06 21:31:01,755 INFO L78 Accepts]: Start accepts. Automaton has 21139 states and 22998 transitions. Word has length 510 [2018-11-06 21:31:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:01,756 INFO L480 AbstractCegarLoop]: Abstraction has 21139 states and 22998 transitions. [2018-11-06 21:31:01,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:31:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21139 states and 22998 transitions. [2018-11-06 21:31:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2018-11-06 21:31:01,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:01,791 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:31:01,791 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:01,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash -619661395, now seen corresponding path program 1 times [2018-11-06 21:31:01,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:01,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:01,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-11-06 21:31:02,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:02,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:31:02,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:31:02,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:31:02,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:02,623 INFO L87 Difference]: Start difference. First operand 21139 states and 22998 transitions. Second operand 3 states. [2018-11-06 21:31:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:05,639 INFO L93 Difference]: Finished difference Result 48589 states and 52847 transitions. [2018-11-06 21:31:05,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:31:05,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 666 [2018-11-06 21:31:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:05,672 INFO L225 Difference]: With dead ends: 48589 [2018-11-06 21:31:05,672 INFO L226 Difference]: Without dead ends: 27752 [2018-11-06 21:31:05,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27752 states. [2018-11-06 21:31:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27752 to 26237. [2018-11-06 21:31:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26237 states. [2018-11-06 21:31:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26237 states to 26237 states and 28404 transitions. [2018-11-06 21:31:06,011 INFO L78 Accepts]: Start accepts. Automaton has 26237 states and 28404 transitions. Word has length 666 [2018-11-06 21:31:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:06,012 INFO L480 AbstractCegarLoop]: Abstraction has 26237 states and 28404 transitions. [2018-11-06 21:31:06,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:31:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 26237 states and 28404 transitions. [2018-11-06 21:31:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2018-11-06 21:31:06,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:06,033 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:31:06,033 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:06,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1256991624, now seen corresponding path program 1 times [2018-11-06 21:31:06,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:06,786 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-06 21:31:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-11-06 21:31:07,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:07,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:31:07,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:31:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:31:07,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:31:07,170 INFO L87 Difference]: Start difference. First operand 26237 states and 28404 transitions. Second operand 5 states. [2018-11-06 21:31:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:11,098 INFO L93 Difference]: Finished difference Result 58786 states and 63444 transitions. [2018-11-06 21:31:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:31:11,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 678 [2018-11-06 21:31:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:11,135 INFO L225 Difference]: With dead ends: 58786 [2018-11-06 21:31:11,136 INFO L226 Difference]: Without dead ends: 34053 [2018-11-06 21:31:11,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:31:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34053 states. [2018-11-06 21:31:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34053 to 27141. [2018-11-06 21:31:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27141 states. [2018-11-06 21:31:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27141 states to 27141 states and 29213 transitions. [2018-11-06 21:31:11,498 INFO L78 Accepts]: Start accepts. Automaton has 27141 states and 29213 transitions. Word has length 678 [2018-11-06 21:31:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:11,500 INFO L480 AbstractCegarLoop]: Abstraction has 27141 states and 29213 transitions. [2018-11-06 21:31:11,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:31:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27141 states and 29213 transitions. [2018-11-06 21:31:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-11-06 21:31:11,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:11,520 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:31:11,520 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:11,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1767342769, now seen corresponding path program 1 times [2018-11-06 21:31:11,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:11,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:11,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:12,086 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-06 21:31:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-11-06 21:31:12,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:12,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:31:12,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:31:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:31:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:31:12,366 INFO L87 Difference]: Start difference. First operand 27141 states and 29213 transitions. Second operand 4 states. [2018-11-06 21:31:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:16,070 INFO L93 Difference]: Finished difference Result 69018 states and 74240 transitions. [2018-11-06 21:31:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:31:16,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 693 [2018-11-06 21:31:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:16,109 INFO L225 Difference]: With dead ends: 69018 [2018-11-06 21:31:16,110 INFO L226 Difference]: Without dead ends: 43981 [2018-11-06 21:31:16,129 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:31:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43981 states. [2018-11-06 21:31:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43981 to 35238. [2018-11-06 21:31:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35238 states. [2018-11-06 21:31:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35238 states to 35238 states and 37356 transitions. [2018-11-06 21:31:16,496 INFO L78 Accepts]: Start accepts. Automaton has 35238 states and 37356 transitions. Word has length 693 [2018-11-06 21:31:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:16,496 INFO L480 AbstractCegarLoop]: Abstraction has 35238 states and 37356 transitions. [2018-11-06 21:31:16,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:31:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35238 states and 37356 transitions. [2018-11-06 21:31:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2018-11-06 21:31:16,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:16,539 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-11-06 21:31:16,540 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:16,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1823544225, now seen corresponding path program 1 times [2018-11-06 21:31:16,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:16,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:16,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:16,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:16,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-11-06 21:31:17,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:31:17,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:31:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:31:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:31:17,308 INFO L87 Difference]: Start difference. First operand 35238 states and 37356 transitions. Second operand 4 states. [2018-11-06 21:31:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:20,139 INFO L93 Difference]: Finished difference Result 76793 states and 81491 transitions. [2018-11-06 21:31:20,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:31:20,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 826 [2018-11-06 21:31:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:20,179 INFO L225 Difference]: With dead ends: 76793 [2018-11-06 21:31:20,179 INFO L226 Difference]: Without dead ends: 43659 [2018-11-06 21:31:20,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:31:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43659 states. [2018-11-06 21:31:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43659 to 36138. [2018-11-06 21:31:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36138 states. [2018-11-06 21:31:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36138 states to 36138 states and 38158 transitions. [2018-11-06 21:31:20,556 INFO L78 Accepts]: Start accepts. Automaton has 36138 states and 38158 transitions. Word has length 826 [2018-11-06 21:31:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:20,557 INFO L480 AbstractCegarLoop]: Abstraction has 36138 states and 38158 transitions. [2018-11-06 21:31:20,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:31:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36138 states and 38158 transitions. [2018-11-06 21:31:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2018-11-06 21:31:20,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:20,590 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,591 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:20,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash 847052626, now seen corresponding path program 1 times [2018-11-06 21:31:20,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:20,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-06 21:31:21,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:31:21,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:31:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:31:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:31:21,440 INFO L87 Difference]: Start difference. First operand 36138 states and 38158 transitions. Second operand 5 states. [2018-11-06 21:31:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:25,145 INFO L93 Difference]: Finished difference Result 79794 states and 84363 transitions. [2018-11-06 21:31:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:31:25,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 863 [2018-11-06 21:31:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:25,187 INFO L225 Difference]: With dead ends: 79794 [2018-11-06 21:31:25,187 INFO L226 Difference]: Without dead ends: 45760 [2018-11-06 21:31:25,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:31:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45760 states. [2018-11-06 21:31:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45760 to 35536. [2018-11-06 21:31:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35536 states. [2018-11-06 21:31:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35536 states to 35536 states and 37464 transitions. [2018-11-06 21:31:25,566 INFO L78 Accepts]: Start accepts. Automaton has 35536 states and 37464 transitions. Word has length 863 [2018-11-06 21:31:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:25,567 INFO L480 AbstractCegarLoop]: Abstraction has 35536 states and 37464 transitions. [2018-11-06 21:31:25,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:31:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 35536 states and 37464 transitions. [2018-11-06 21:31:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2018-11-06 21:31:25,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:25,594 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,594 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:25,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1703283928, now seen corresponding path program 1 times [2018-11-06 21:31:25,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:25,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:26,355 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-06 21:31:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 1097 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-11-06 21:31:26,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:26,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:31:26,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:31:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:31:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:31:26,905 INFO L87 Difference]: Start difference. First operand 35536 states and 37464 transitions. Second operand 6 states. [2018-11-06 21:31:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:30,978 INFO L93 Difference]: Finished difference Result 79433 states and 83543 transitions. [2018-11-06 21:31:30,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:31:30,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 897 [2018-11-06 21:31:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:31,018 INFO L225 Difference]: With dead ends: 79433 [2018-11-06 21:31:31,019 INFO L226 Difference]: Without dead ends: 44199 [2018-11-06 21:31:31,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:31:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44199 states. [2018-11-06 21:31:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44199 to 36405. [2018-11-06 21:31:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36405 states. [2018-11-06 21:31:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36405 states to 36405 states and 38171 transitions. [2018-11-06 21:31:31,360 INFO L78 Accepts]: Start accepts. Automaton has 36405 states and 38171 transitions. Word has length 897 [2018-11-06 21:31:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:31,361 INFO L480 AbstractCegarLoop]: Abstraction has 36405 states and 38171 transitions. [2018-11-06 21:31:31,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:31:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36405 states and 38171 transitions. [2018-11-06 21:31:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2018-11-06 21:31:31,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:31,386 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,387 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:31,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1454958507, now seen corresponding path program 1 times [2018-11-06 21:31:31,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:31,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:32,276 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:31:32,497 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-11-06 21:31:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 1179 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 21:31:33,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:31:33,859 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:31:34,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:34,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:31:52,110 WARN L179 SmtUtils]: Spent 17.37 s on a formula simplification. DAG size of input: 462 DAG size of output: 50 [2018-11-06 21:31:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2018-11-06 21:31:53,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:31:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2018-11-06 21:31:53,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:31:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:31:53,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:31:53,163 INFO L87 Difference]: Start difference. First operand 36405 states and 38171 transitions. Second operand 8 states. [2018-11-06 21:32:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:49,166 INFO L93 Difference]: Finished difference Result 82738 states and 86736 transitions. [2018-11-06 21:32:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:32:49,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 916 [2018-11-06 21:32:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:49,219 INFO L225 Difference]: With dead ends: 82738 [2018-11-06 21:32:49,220 INFO L226 Difference]: Without dead ends: 47837 [2018-11-06 21:32:49,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 915 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:32:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47837 states. [2018-11-06 21:32:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47837 to 42415. [2018-11-06 21:32:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42415 states. [2018-11-06 21:32:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42415 states to 42415 states and 44424 transitions. [2018-11-06 21:32:49,664 INFO L78 Accepts]: Start accepts. Automaton has 42415 states and 44424 transitions. Word has length 916 [2018-11-06 21:32:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:49,665 INFO L480 AbstractCegarLoop]: Abstraction has 42415 states and 44424 transitions. [2018-11-06 21:32:49,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:32:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42415 states and 44424 transitions. [2018-11-06 21:32:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2018-11-06 21:32:49,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:49,698 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,699 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:49,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:49,699 INFO L82 PathProgramCache]: Analyzing trace with hash -756145082, now seen corresponding path program 1 times [2018-11-06 21:32:49,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:49,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:49,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:49,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:49,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 978 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-11-06 21:32:50,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:50,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:32:50,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:32:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:32:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:32:50,297 INFO L87 Difference]: Start difference. First operand 42415 states and 44424 transitions. Second operand 3 states. [2018-11-06 21:32:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:52,329 INFO L93 Difference]: Finished difference Result 78216 states and 82000 transitions. [2018-11-06 21:32:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:32:52,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 937 [2018-11-06 21:32:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:52,366 INFO L225 Difference]: With dead ends: 78216 [2018-11-06 21:32:52,366 INFO L226 Difference]: Without dead ends: 42413 [2018-11-06 21:32:52,379 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:32:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2018-11-06 21:32:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 42113. [2018-11-06 21:32:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42113 states. [2018-11-06 21:32:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42113 states to 42113 states and 44107 transitions. [2018-11-06 21:32:52,783 INFO L78 Accepts]: Start accepts. Automaton has 42113 states and 44107 transitions. Word has length 937 [2018-11-06 21:32:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:52,783 INFO L480 AbstractCegarLoop]: Abstraction has 42113 states and 44107 transitions. [2018-11-06 21:32:52,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:32:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 42113 states and 44107 transitions. [2018-11-06 21:32:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 979 [2018-11-06 21:32:52,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:52,808 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:32:52,809 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:52,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1218500640, now seen corresponding path program 1 times [2018-11-06 21:32:52,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:52,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2018-11-06 21:32:53,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:53,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:32:53,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:32:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:32:53,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:32:53,629 INFO L87 Difference]: Start difference. First operand 42113 states and 44107 transitions. Second operand 3 states. [2018-11-06 21:32:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:55,621 INFO L93 Difference]: Finished difference Result 87239 states and 91373 transitions. [2018-11-06 21:32:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:32:55,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 978 [2018-11-06 21:32:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:55,666 INFO L225 Difference]: With dead ends: 87239 [2018-11-06 21:32:55,666 INFO L226 Difference]: Without dead ends: 45428 [2018-11-06 21:32:55,687 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:32:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45428 states. [2018-11-06 21:32:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45428 to 43284. [2018-11-06 21:32:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43284 states. [2018-11-06 21:32:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43284 states to 43284 states and 45130 transitions. [2018-11-06 21:32:56,147 INFO L78 Accepts]: Start accepts. Automaton has 43284 states and 45130 transitions. Word has length 978 [2018-11-06 21:32:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:56,148 INFO L480 AbstractCegarLoop]: Abstraction has 43284 states and 45130 transitions. [2018-11-06 21:32:56,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:32:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 43284 states and 45130 transitions. [2018-11-06 21:32:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2018-11-06 21:32:56,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:56,404 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:32:56,404 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:56,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -364245602, now seen corresponding path program 1 times [2018-11-06 21:32:56,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:56,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:56,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:56,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2018-11-06 21:32:57,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:57,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:32:57,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:32:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:32:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:32:57,584 INFO L87 Difference]: Start difference. First operand 43284 states and 45130 transitions. Second operand 3 states. [2018-11-06 21:32:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:59,213 INFO L93 Difference]: Finished difference Result 72896 states and 75948 transitions. [2018-11-06 21:32:59,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:32:59,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 984 [2018-11-06 21:32:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:59,242 INFO L225 Difference]: With dead ends: 72896 [2018-11-06 21:32:59,243 INFO L226 Difference]: Without dead ends: 29712 [2018-11-06 21:32:59,263 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:32:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29712 states. [2018-11-06 21:32:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29712 to 26412. [2018-11-06 21:32:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26412 states. [2018-11-06 21:32:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26412 states to 26412 states and 27212 transitions. [2018-11-06 21:32:59,569 INFO L78 Accepts]: Start accepts. Automaton has 26412 states and 27212 transitions. Word has length 984 [2018-11-06 21:32:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:59,569 INFO L480 AbstractCegarLoop]: Abstraction has 26412 states and 27212 transitions. [2018-11-06 21:32:59,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:32:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26412 states and 27212 transitions. [2018-11-06 21:32:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-11-06 21:32:59,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:59,590 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:32:59,591 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:59,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1394382459, now seen corresponding path program 1 times [2018-11-06 21:32:59,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:59,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:59,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:59,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:59,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2018-11-06 21:33:00,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:00,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:33:00,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:33:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:33:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:33:00,973 INFO L87 Difference]: Start difference. First operand 26412 states and 27212 transitions. Second operand 3 states. [2018-11-06 21:33:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:02,684 INFO L93 Difference]: Finished difference Result 46813 states and 48255 transitions. [2018-11-06 21:33:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:33:02,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1066 [2018-11-06 21:33:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:02,705 INFO L225 Difference]: With dead ends: 46813 [2018-11-06 21:33:02,705 INFO L226 Difference]: Without dead ends: 26711 [2018-11-06 21:33:02,715 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:33:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26711 states. [2018-11-06 21:33:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26711 to 26411. [2018-11-06 21:33:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26411 states. [2018-11-06 21:33:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26411 states to 26411 states and 27210 transitions. [2018-11-06 21:33:02,942 INFO L78 Accepts]: Start accepts. Automaton has 26411 states and 27210 transitions. Word has length 1066 [2018-11-06 21:33:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:02,943 INFO L480 AbstractCegarLoop]: Abstraction has 26411 states and 27210 transitions. [2018-11-06 21:33:02,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:33:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26411 states and 27210 transitions. [2018-11-06 21:33:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1241 [2018-11-06 21:33:02,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:02,968 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:33:02,968 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:02,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1567530624, now seen corresponding path program 1 times [2018-11-06 21:33:02,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:02,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:02,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2960 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 2018 trivial. 0 not checked. [2018-11-06 21:33:04,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:04,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:33:04,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:33:04,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:33:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:04,458 INFO L87 Difference]: Start difference. First operand 26411 states and 27210 transitions. Second operand 5 states. [2018-11-06 21:33:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:07,415 INFO L93 Difference]: Finished difference Result 54928 states and 56630 transitions. [2018-11-06 21:33:07,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:33:07,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1240 [2018-11-06 21:33:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:07,448 INFO L225 Difference]: With dead ends: 54928 [2018-11-06 21:33:07,448 INFO L226 Difference]: Without dead ends: 34227 [2018-11-06 21:33:07,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34227 states. [2018-11-06 21:33:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34227 to 24311. [2018-11-06 21:33:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24311 states. [2018-11-06 21:33:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24311 states to 24311 states and 25053 transitions. [2018-11-06 21:33:07,732 INFO L78 Accepts]: Start accepts. Automaton has 24311 states and 25053 transitions. Word has length 1240 [2018-11-06 21:33:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 24311 states and 25053 transitions. [2018-11-06 21:33:07,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:33:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 24311 states and 25053 transitions. [2018-11-06 21:33:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1334 [2018-11-06 21:33:07,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:07,754 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:33:07,755 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:07,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash 340667387, now seen corresponding path program 1 times [2018-11-06 21:33:07,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3338 backedges. 2249 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-11-06 21:33:09,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:33:09,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:33:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:33:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:09,798 INFO L87 Difference]: Start difference. First operand 24311 states and 25053 transitions. Second operand 4 states. [2018-11-06 21:33:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:12,598 INFO L93 Difference]: Finished difference Result 45105 states and 46449 transitions. [2018-11-06 21:33:12,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:12,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1333 [2018-11-06 21:33:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:12,620 INFO L225 Difference]: With dead ends: 45105 [2018-11-06 21:33:12,621 INFO L226 Difference]: Without dead ends: 25602 [2018-11-06 21:33:12,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25602 states. [2018-11-06 21:33:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25602 to 22863. [2018-11-06 21:33:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22863 states. [2018-11-06 21:33:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22863 states to 22863 states and 23472 transitions. [2018-11-06 21:33:12,852 INFO L78 Accepts]: Start accepts. Automaton has 22863 states and 23472 transitions. Word has length 1333 [2018-11-06 21:33:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:12,853 INFO L480 AbstractCegarLoop]: Abstraction has 22863 states and 23472 transitions. [2018-11-06 21:33:12,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:33:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22863 states and 23472 transitions. [2018-11-06 21:33:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1362 [2018-11-06 21:33:12,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:12,875 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:33:12,875 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:12,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -643379249, now seen corresponding path program 1 times [2018-11-06 21:33:12,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:13,610 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 21:33:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 1986 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2018-11-06 21:33:15,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:15,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 21:33:15,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:33:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:33:15,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:33:15,803 INFO L87 Difference]: Start difference. First operand 22863 states and 23472 transitions. Second operand 8 states. [2018-11-06 21:33:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:19,776 INFO L93 Difference]: Finished difference Result 37064 states and 38027 transitions. [2018-11-06 21:33:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:33:19,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1361 [2018-11-06 21:33:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:19,781 INFO L225 Difference]: With dead ends: 37064 [2018-11-06 21:33:19,781 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:33:19,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:33:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:33:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:33:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:33:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:33:19,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1361 [2018-11-06 21:33:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:19,794 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:33:19,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:33:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:33:19,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:33:19,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:33:20,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:20,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:20,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:20,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:21,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:21,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:22,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:22,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:22,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:22,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:23,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:23,377 WARN L179 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 1073 DAG size of output: 943 [2018-11-06 21:33:23,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:23,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:23,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:23,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:24,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:24,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:24,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:24,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,600 WARN L179 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 1070 DAG size of output: 942 [2018-11-06 21:33:25,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:25,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:26,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:26,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:26,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:26,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:26,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:33:26,775 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 803 DAG size of output: 715 [2018-11-06 21:33:45,766 WARN L179 SmtUtils]: Spent 18.98 s on a formula simplification. DAG size of input: 912 DAG size of output: 124 Received shutdown request... [2018-11-06 21:33:48,973 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-11-06 21:33:48,973 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-06 21:33:48,975 INFO L168 Benchmark]: Toolchain (without parser) took 233261.75 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:33:48,976 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:33:48,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1277.14 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:33:48,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 418.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:48,978 INFO L168 Benchmark]: Boogie Preprocessor took 215.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:48,978 INFO L168 Benchmark]: RCFGBuilder took 6325.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.4 MB). Peak memory consumption was 294.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:48,979 INFO L168 Benchmark]: TraceAbstraction took 225019.70 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 21:33:48,986 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1277.14 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 418.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 215.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6325.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.4 MB). Peak memory consumption was 294.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225019.70 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 912. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown