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/Problem03_label38_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:58:07,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:58:07,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:58:07,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:58:07,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:58:07,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:58:07,648 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:58:07,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:58:07,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:58:07,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:58:07,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:58:07,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:58:07,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:58:07,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:58:07,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:58:07,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:58:07,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:58:07,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:58:07,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:58:07,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:58:07,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:58:07,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:58:07,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:58:07,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:58:07,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:58:07,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:58:07,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:58:07,672 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:58:07,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:58:07,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:58:07,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:58:07,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:58:07,675 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:58:07,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:58:07,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:58:07,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:58:07,678 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:58:07,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:58:07,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:58:07,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:58:07,698 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:58:07,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:58:07,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:58:07,699 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:58:07,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:58:07,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:58:07,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:58:07,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:58:07,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:58:07,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:58:07,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:58:07,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:58:07,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:58:07,701 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:58:07,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:58:07,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:58:07,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:58:07,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:58:07,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:58:07,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:58:07,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:58:07,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:58:07,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:58:07,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:58:07,704 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:58:07,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:58:07,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:58:07,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:58:07,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:58:07,775 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:58:07,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-11-06 19:58:07,839 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89fc6ce8/39e0362fc17342dc8104176cf2926bc2/FLAGf3011c150 [2018-11-06 19:58:08,500 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:58:08,501 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-11-06 19:58:08,525 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89fc6ce8/39e0362fc17342dc8104176cf2926bc2/FLAGf3011c150 [2018-11-06 19:58:08,548 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89fc6ce8/39e0362fc17342dc8104176cf2926bc2 [2018-11-06 19:58:08,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:58:08,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:58:08,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:58:08,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:58:08,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:58:08,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:58:08" (1/1) ... [2018-11-06 19:58:08,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:08, skipping insertion in model container [2018-11-06 19:58:08,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:58:08" (1/1) ... [2018-11-06 19:58:08,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:58:08,674 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:58:09,419 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:58:09,425 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:58:09,724 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:58:09,746 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:58:09,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09 WrapperNode [2018-11-06 19:58:09,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:58:09,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:58:09,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:58:09,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:58:09,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:09,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:58:10,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:58:10,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:58:10,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:58:10,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... [2018-11-06 19:58:10,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:58:10,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:58:10,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:58:10,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:58:10,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:58:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:58:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:58:10,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:58:15,803 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:58:15,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:58:15 BoogieIcfgContainer [2018-11-06 19:58:15,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:58:15,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:58:15,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:58:15,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:58:15,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:58:08" (1/3) ... [2018-11-06 19:58:15,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d16e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:58:15, skipping insertion in model container [2018-11-06 19:58:15,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:58:09" (2/3) ... [2018-11-06 19:58:15,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d16e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:58:15, skipping insertion in model container [2018-11-06 19:58:15,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:58:15" (3/3) ... [2018-11-06 19:58:15,812 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label38_true-unreach-call.c [2018-11-06 19:58:15,824 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:58:15,832 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:58:15,849 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:58:15,891 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:58:15,892 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:58:15,892 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:58:15,893 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:58:15,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:58:15,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:58:15,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:58:15,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:58:15,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:58:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:58:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-06 19:58:15,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:15,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:15,948 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:15,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1988565156, now seen corresponding path program 1 times [2018-11-06 19:58:15,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:15,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:16,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:16,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:16,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:16,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:16,890 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-11-06 19:58:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:19,488 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-11-06 19:58:19,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:19,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-11-06 19:58:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:19,516 INFO L225 Difference]: With dead ends: 832 [2018-11-06 19:58:19,516 INFO L226 Difference]: Without dead ends: 525 [2018-11-06 19:58:19,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-11-06 19:58:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-11-06 19:58:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-11-06 19:58:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-11-06 19:58:19,611 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 202 [2018-11-06 19:58:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:19,613 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-11-06 19:58:19,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-11-06 19:58:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-06 19:58:19,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:19,622 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:19,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:19,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:19,624 INFO L82 PathProgramCache]: Analyzing trace with hash 170905101, now seen corresponding path program 1 times [2018-11-06 19:58:19,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:19,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:19,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:19,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:19,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:20,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:20,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:20,060 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-11-06 19:58:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:24,416 INFO L93 Difference]: Finished difference Result 1893 states and 3348 transitions. [2018-11-06 19:58:24,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:24,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-11-06 19:58:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:24,427 INFO L225 Difference]: With dead ends: 1893 [2018-11-06 19:58:24,427 INFO L226 Difference]: Without dead ends: 1384 [2018-11-06 19:58:24,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-11-06 19:58:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 923. [2018-11-06 19:58:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-06 19:58:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-11-06 19:58:24,475 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 208 [2018-11-06 19:58:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:24,476 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-11-06 19:58:24,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-11-06 19:58:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 19:58:24,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:24,482 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:24,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:24,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash -461514232, now seen corresponding path program 1 times [2018-11-06 19:58:24,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:24,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:24,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:24,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:24,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:24,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:24,817 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-11-06 19:58:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:26,521 INFO L93 Difference]: Finished difference Result 2673 states and 4433 transitions. [2018-11-06 19:58:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:26,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-06 19:58:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:26,533 INFO L225 Difference]: With dead ends: 2673 [2018-11-06 19:58:26,533 INFO L226 Difference]: Without dead ends: 1752 [2018-11-06 19:58:26,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-11-06 19:58:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1751. [2018-11-06 19:58:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-11-06 19:58:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-11-06 19:58:26,573 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 210 [2018-11-06 19:58:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:26,574 INFO L480 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-11-06 19:58:26,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-11-06 19:58:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-06 19:58:26,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:26,580 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:26,581 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:26,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -675094169, now seen corresponding path program 1 times [2018-11-06 19:58:26,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:26,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 19:58:26,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:26,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:26,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:26,721 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-11-06 19:58:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:28,084 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-11-06 19:58:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:28,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-06 19:58:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:28,100 INFO L225 Difference]: With dead ends: 4329 [2018-11-06 19:58:28,100 INFO L226 Difference]: Without dead ends: 2580 [2018-11-06 19:58:28,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-11-06 19:58:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-11-06 19:58:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-11-06 19:58:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-11-06 19:58:28,154 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 219 [2018-11-06 19:58:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:28,155 INFO L480 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-11-06 19:58:28,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-11-06 19:58:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-06 19:58:28,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:28,163 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:28,163 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:28,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1924425440, now seen corresponding path program 1 times [2018-11-06 19:58:28,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:28,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:28,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:28,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:28,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:58:28,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:28,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:28,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:28,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:28,301 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-11-06 19:58:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:28,968 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-11-06 19:58:28,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:28,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-06 19:58:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:28,990 INFO L225 Difference]: With dead ends: 7713 [2018-11-06 19:58:28,991 INFO L226 Difference]: Without dead ends: 5136 [2018-11-06 19:58:28,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-11-06 19:58:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-11-06 19:58:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-11-06 19:58:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-11-06 19:58:29,099 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 225 [2018-11-06 19:58:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:29,100 INFO L480 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-11-06 19:58:29,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-11-06 19:58:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-06 19:58:29,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:29,112 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:29,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:29,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash -942595079, now seen corresponding path program 1 times [2018-11-06 19:58:29,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:29,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:29,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-06 19:58:29,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:29,438 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:29,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:29,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:58:29,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:29,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 19:58:29,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:29,705 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-11-06 19:58:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:32,210 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-11-06 19:58:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:32,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2018-11-06 19:58:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:32,271 INFO L225 Difference]: With dead ends: 20487 [2018-11-06 19:58:32,271 INFO L226 Difference]: Without dead ends: 15356 [2018-11-06 19:58:32,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-11-06 19:58:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-11-06 19:58:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-11-06 19:58:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-11-06 19:58:32,543 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 234 [2018-11-06 19:58:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:32,543 INFO L480 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-11-06 19:58:32,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-11-06 19:58:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-06 19:58:32,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:32,564 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:32,565 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:32,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash -42517928, now seen corresponding path program 1 times [2018-11-06 19:58:32,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:32,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:33,078 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:58:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:33,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:33,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:58:33,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:58:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:58:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:58:33,141 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-11-06 19:58:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:38,852 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-11-06 19:58:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:58:38,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2018-11-06 19:58:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:38,892 INFO L225 Difference]: With dead ends: 23029 [2018-11-06 19:58:38,892 INFO L226 Difference]: Without dead ends: 12802 [2018-11-06 19:58:38,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:58:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-11-06 19:58:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-11-06 19:58:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-11-06 19:58:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-11-06 19:58:39,085 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 242 [2018-11-06 19:58:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:39,086 INFO L480 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-11-06 19:58:39,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:58:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-11-06 19:58:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-06 19:58:39,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:39,106 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:39,106 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:39,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1670858200, now seen corresponding path program 1 times [2018-11-06 19:58:39,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 19:58:39,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:39,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:39,361 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 4 states. [2018-11-06 19:58:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:41,848 INFO L93 Difference]: Finished difference Result 41024 states and 61360 transitions. [2018-11-06 19:58:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:41,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-11-06 19:58:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:41,916 INFO L225 Difference]: With dead ends: 41024 [2018-11-06 19:58:41,916 INFO L226 Difference]: Without dead ends: 29981 [2018-11-06 19:58:41,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29981 states. [2018-11-06 19:58:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29981 to 20440. [2018-11-06 19:58:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-11-06 19:58:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 29051 transitions. [2018-11-06 19:58:42,317 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 29051 transitions. Word has length 242 [2018-11-06 19:58:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:42,317 INFO L480 AbstractCegarLoop]: Abstraction has 20440 states and 29051 transitions. [2018-11-06 19:58:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 29051 transitions. [2018-11-06 19:58:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-06 19:58:42,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:42,354 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:42,354 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:42,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2012852909, now seen corresponding path program 1 times [2018-11-06 19:58:42,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:42,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:58:42,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:42,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:42,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:42,507 INFO L87 Difference]: Start difference. First operand 20440 states and 29051 transitions. Second operand 3 states. [2018-11-06 19:58:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:44,225 INFO L93 Difference]: Finished difference Result 40906 states and 58154 transitions. [2018-11-06 19:58:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:44,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-11-06 19:58:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:44,259 INFO L225 Difference]: With dead ends: 40906 [2018-11-06 19:58:44,259 INFO L226 Difference]: Without dead ends: 20468 [2018-11-06 19:58:44,279 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 19:58:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-11-06 19:58:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20440. [2018-11-06 19:58:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-11-06 19:58:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 27343 transitions. [2018-11-06 19:58:44,538 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 27343 transitions. Word has length 243 [2018-11-06 19:58:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:44,539 INFO L480 AbstractCegarLoop]: Abstraction has 20440 states and 27343 transitions. [2018-11-06 19:58:44,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 27343 transitions. [2018-11-06 19:58:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-06 19:58:44,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:44,567 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:44,568 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:44,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1161717019, now seen corresponding path program 1 times [2018-11-06 19:58:44,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:44,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:44,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 19:58:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:44,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:44,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:44,729 INFO L87 Difference]: Start difference. First operand 20440 states and 27343 transitions. Second operand 3 states. [2018-11-06 19:58:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:46,522 INFO L93 Difference]: Finished difference Result 57404 states and 76442 transitions. [2018-11-06 19:58:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:46,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-11-06 19:58:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:46,556 INFO L225 Difference]: With dead ends: 57404 [2018-11-06 19:58:46,556 INFO L226 Difference]: Without dead ends: 36966 [2018-11-06 19:58:46,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36966 states. [2018-11-06 19:58:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36966 to 36958. [2018-11-06 19:58:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36958 states. [2018-11-06 19:58:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36958 states to 36958 states and 44611 transitions. [2018-11-06 19:58:47,011 INFO L78 Accepts]: Start accepts. Automaton has 36958 states and 44611 transitions. Word has length 250 [2018-11-06 19:58:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:47,011 INFO L480 AbstractCegarLoop]: Abstraction has 36958 states and 44611 transitions. [2018-11-06 19:58:47,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36958 states and 44611 transitions. [2018-11-06 19:58:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-06 19:58:47,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:47,046 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:47,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:47,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash -50667516, now seen corresponding path program 1 times [2018-11-06 19:58:47,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:47,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:47,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-06 19:58:47,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:47,409 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:47,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:47,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-06 19:58:47,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:47,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-11-06 19:58:47,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:58:47,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:58:47,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:58:47,867 INFO L87 Difference]: Start difference. First operand 36958 states and 44611 transitions. Second operand 7 states. [2018-11-06 19:58:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:54,434 INFO L93 Difference]: Finished difference Result 148408 states and 179941 transitions. [2018-11-06 19:58:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:58:54,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-11-06 19:58:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:54,554 INFO L225 Difference]: With dead ends: 148408 [2018-11-06 19:58:54,554 INFO L226 Difference]: Without dead ends: 111452 [2018-11-06 19:58:54,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:58:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111452 states. [2018-11-06 19:58:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111452 to 111428. [2018-11-06 19:58:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111428 states. [2018-11-06 19:58:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111428 states to 111428 states and 129315 transitions. [2018-11-06 19:58:56,099 INFO L78 Accepts]: Start accepts. Automaton has 111428 states and 129315 transitions. Word has length 273 [2018-11-06 19:58:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:56,100 INFO L480 AbstractCegarLoop]: Abstraction has 111428 states and 129315 transitions. [2018-11-06 19:58:56,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:58:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 111428 states and 129315 transitions. [2018-11-06 19:58:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-06 19:58:56,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:56,143 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:56,143 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:56,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -996362106, now seen corresponding path program 1 times [2018-11-06 19:58:56,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 19:58:56,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:56,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:56,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:56,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:56,377 INFO L87 Difference]: Start difference. First operand 111428 states and 129315 transitions. Second operand 4 states. [2018-11-06 19:59:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:00,605 INFO L93 Difference]: Finished difference Result 351941 states and 407982 transitions. [2018-11-06 19:59:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:00,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-11-06 19:59:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:00,842 INFO L225 Difference]: With dead ends: 351941 [2018-11-06 19:59:00,842 INFO L226 Difference]: Without dead ends: 240515 [2018-11-06 19:59:00,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240515 states. [2018-11-06 19:59:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240515 to 177289. [2018-11-06 19:59:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177289 states. [2018-11-06 19:59:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177289 states to 177289 states and 203822 transitions. [2018-11-06 19:59:02,713 INFO L78 Accepts]: Start accepts. Automaton has 177289 states and 203822 transitions. Word has length 302 [2018-11-06 19:59:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:02,713 INFO L480 AbstractCegarLoop]: Abstraction has 177289 states and 203822 transitions. [2018-11-06 19:59:02,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 177289 states and 203822 transitions. [2018-11-06 19:59:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-06 19:59:02,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:02,792 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 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] [2018-11-06 19:59:02,792 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:02,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1793634105, now seen corresponding path program 1 times [2018-11-06 19:59:02,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:02,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:02,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-06 19:59:03,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:03,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:03,908 INFO L87 Difference]: Start difference. First operand 177289 states and 203822 transitions. Second operand 3 states. [2018-11-06 19:59:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:05,864 INFO L93 Difference]: Finished difference Result 354568 states and 407634 transitions. [2018-11-06 19:59:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:05,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-06 19:59:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:06,050 INFO L225 Difference]: With dead ends: 354568 [2018-11-06 19:59:06,050 INFO L226 Difference]: Without dead ends: 177281 [2018-11-06 19:59:06,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177281 states. [2018-11-06 19:59:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177281 to 177281. [2018-11-06 19:59:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177281 states. [2018-11-06 19:59:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177281 states to 177281 states and 203798 transitions. [2018-11-06 19:59:09,553 INFO L78 Accepts]: Start accepts. Automaton has 177281 states and 203798 transitions. Word has length 330 [2018-11-06 19:59:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:09,554 INFO L480 AbstractCegarLoop]: Abstraction has 177281 states and 203798 transitions. [2018-11-06 19:59:09,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 177281 states and 203798 transitions. [2018-11-06 19:59:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-11-06 19:59:09,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:09,624 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 19:59:09,624 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:09,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1310769329, now seen corresponding path program 1 times [2018-11-06 19:59:09,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:09,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:09,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 19:59:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:09,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:09,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:09,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:09,849 INFO L87 Difference]: Start difference. First operand 177281 states and 203798 transitions. Second operand 3 states. [2018-11-06 19:59:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:12,221 INFO L93 Difference]: Finished difference Result 350124 states and 402284 transitions. [2018-11-06 19:59:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:12,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-11-06 19:59:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:12,380 INFO L225 Difference]: With dead ends: 350124 [2018-11-06 19:59:12,380 INFO L226 Difference]: Without dead ends: 172845 [2018-11-06 19:59:12,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172845 states. [2018-11-06 19:59:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172845 to 172845. [2018-11-06 19:59:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172845 states. [2018-11-06 19:59:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172845 states to 172845 states and 196910 transitions. [2018-11-06 19:59:20,085 INFO L78 Accepts]: Start accepts. Automaton has 172845 states and 196910 transitions. Word has length 332 [2018-11-06 19:59:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:20,085 INFO L480 AbstractCegarLoop]: Abstraction has 172845 states and 196910 transitions. [2018-11-06 19:59:20,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 172845 states and 196910 transitions. [2018-11-06 19:59:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-06 19:59:20,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:20,127 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:59:20,127 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:20,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1850297527, now seen corresponding path program 1 times [2018-11-06 19:59:20,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:20,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:20,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:20,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:20,588 INFO L87 Difference]: Start difference. First operand 172845 states and 196910 transitions. Second operand 4 states. [2018-11-06 19:59:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:24,717 INFO L93 Difference]: Finished difference Result 659659 states and 751671 transitions. [2018-11-06 19:59:24,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:24,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-11-06 19:59:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:25,357 INFO L225 Difference]: With dead ends: 659659 [2018-11-06 19:59:25,357 INFO L226 Difference]: Without dead ends: 486816 [2018-11-06 19:59:25,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486816 states. [2018-11-06 19:59:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486816 to 322964. [2018-11-06 19:59:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322964 states. [2018-11-06 19:59:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322964 states to 322964 states and 368236 transitions. [2018-11-06 19:59:31,422 INFO L78 Accepts]: Start accepts. Automaton has 322964 states and 368236 transitions. Word has length 345 [2018-11-06 19:59:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:31,422 INFO L480 AbstractCegarLoop]: Abstraction has 322964 states and 368236 transitions. [2018-11-06 19:59:31,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 322964 states and 368236 transitions. [2018-11-06 19:59:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-06 19:59:31,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:31,487 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 2, 2, 2, 2, 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 19:59:31,488 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:31,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash 972731471, now seen corresponding path program 1 times [2018-11-06 19:59:31,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:31,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:31,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-06 19:59:31,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:31,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:31,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:31,772 INFO L87 Difference]: Start difference. First operand 322964 states and 368236 transitions. Second operand 4 states. [2018-11-06 19:59:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:36,567 INFO L93 Difference]: Finished difference Result 663142 states and 756901 transitions. [2018-11-06 19:59:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:36,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-11-06 19:59:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:37,111 INFO L225 Difference]: With dead ends: 663142 [2018-11-06 19:59:37,111 INFO L226 Difference]: Without dead ends: 340180 [2018-11-06 19:59:38,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340180 states. [2018-11-06 19:59:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340180 to 340130. [2018-11-06 19:59:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340130 states. [2018-11-06 19:59:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340130 states to 340130 states and 387085 transitions. [2018-11-06 19:59:44,741 INFO L78 Accepts]: Start accepts. Automaton has 340130 states and 387085 transitions. Word has length 346 [2018-11-06 19:59:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:44,741 INFO L480 AbstractCegarLoop]: Abstraction has 340130 states and 387085 transitions. [2018-11-06 19:59:44,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 340130 states and 387085 transitions. [2018-11-06 19:59:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-06 19:59:44,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:44,789 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:44,789 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:44,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1494854117, now seen corresponding path program 1 times [2018-11-06 19:59:44,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:44,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:44,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:45,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:45,174 INFO L87 Difference]: Start difference. First operand 340130 states and 387085 transitions. Second operand 4 states. [2018-11-06 19:59:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:54,214 INFO L93 Difference]: Finished difference Result 696743 states and 795694 transitions. [2018-11-06 19:59:54,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:54,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-11-06 19:59:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:54,711 INFO L225 Difference]: With dead ends: 696743 [2018-11-06 19:59:54,711 INFO L226 Difference]: Without dead ends: 356615 [2018-11-06 19:59:54,852 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 19:59:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356615 states. [2018-11-06 19:59:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356615 to 339463. [2018-11-06 19:59:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339463 states. [2018-11-06 19:59:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339463 states to 339463 states and 383111 transitions. [2018-11-06 19:59:59,830 INFO L78 Accepts]: Start accepts. Automaton has 339463 states and 383111 transitions. Word has length 351 [2018-11-06 19:59:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:59,830 INFO L480 AbstractCegarLoop]: Abstraction has 339463 states and 383111 transitions. [2018-11-06 19:59:59,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 339463 states and 383111 transitions. [2018-11-06 19:59:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-06 19:59:59,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:59,890 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:59,890 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:59,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash -846916471, now seen corresponding path program 1 times [2018-11-06 19:59:59,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 20:00:00,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:00,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:00,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:00,130 INFO L87 Difference]: Start difference. First operand 339463 states and 383111 transitions. Second operand 3 states. [2018-11-06 20:00:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:04,298 INFO L93 Difference]: Finished difference Result 641129 states and 725196 transitions. [2018-11-06 20:00:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:04,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2018-11-06 20:00:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:04,678 INFO L225 Difference]: With dead ends: 641129 [2018-11-06 20:00:04,678 INFO L226 Difference]: Without dead ends: 301668 [2018-11-06 20:00:04,836 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 20:00:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301668 states. [2018-11-06 20:00:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301668 to 296960. [2018-11-06 20:00:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296960 states. [2018-11-06 20:00:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296960 states to 296960 states and 328199 transitions. [2018-11-06 20:00:10,373 INFO L78 Accepts]: Start accepts. Automaton has 296960 states and 328199 transitions. Word has length 368 [2018-11-06 20:00:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:10,374 INFO L480 AbstractCegarLoop]: Abstraction has 296960 states and 328199 transitions. [2018-11-06 20:00:10,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 296960 states and 328199 transitions. [2018-11-06 20:00:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-06 20:00:10,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:10,427 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:10,427 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:10,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash -893696450, now seen corresponding path program 1 times [2018-11-06 20:00:10,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:10,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:10,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-06 20:00:10,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:10,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:10,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:10,749 INFO L87 Difference]: Start difference. First operand 296960 states and 328199 transitions. Second operand 4 states. [2018-11-06 20:00:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:17,755 INFO L93 Difference]: Finished difference Result 1111747 states and 1228016 transitions. [2018-11-06 20:00:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:17,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-11-06 20:00:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:18,739 INFO L225 Difference]: With dead ends: 1111747 [2018-11-06 20:00:18,740 INFO L226 Difference]: Without dead ends: 814789 [2018-11-06 20:00:18,869 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814789 states. [2018-11-06 20:00:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814789 to 524785. [2018-11-06 20:00:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524785 states. [2018-11-06 20:00:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524785 states to 524785 states and 579152 transitions. [2018-11-06 20:00:35,516 INFO L78 Accepts]: Start accepts. Automaton has 524785 states and 579152 transitions. Word has length 374 [2018-11-06 20:00:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:35,516 INFO L480 AbstractCegarLoop]: Abstraction has 524785 states and 579152 transitions. [2018-11-06 20:00:35,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 524785 states and 579152 transitions. [2018-11-06 20:00:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-11-06 20:00:35,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:35,565 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 20:00:35,565 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:35,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1326023536, now seen corresponding path program 1 times [2018-11-06 20:00:35,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:35,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-06 20:00:35,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:35,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:00:35,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:35,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:35,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:35,852 INFO L87 Difference]: Start difference. First operand 524785 states and 579152 transitions. Second operand 4 states. [2018-11-06 20:00:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:41,918 INFO L93 Difference]: Finished difference Result 1050464 states and 1158599 transitions. [2018-11-06 20:00:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:41,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-11-06 20:00:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:42,559 INFO L225 Difference]: With dead ends: 1050464 [2018-11-06 20:00:42,559 INFO L226 Difference]: Without dead ends: 525681 [2018-11-06 20:00:42,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525681 states. [2018-11-06 20:00:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525681 to 505523. [2018-11-06 20:00:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505523 states. [2018-11-06 20:00:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505523 states to 505523 states and 554820 transitions. [2018-11-06 20:00:51,962 INFO L78 Accepts]: Start accepts. Automaton has 505523 states and 554820 transitions. Word has length 385 [2018-11-06 20:00:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:51,962 INFO L480 AbstractCegarLoop]: Abstraction has 505523 states and 554820 transitions. [2018-11-06 20:00:51,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 505523 states and 554820 transitions. [2018-11-06 20:00:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-11-06 20:00:52,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:52,018 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:52,018 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:52,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682089, now seen corresponding path program 1 times [2018-11-06 20:00:52,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:52,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:52,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 20:00:52,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:52,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:52,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:52,267 INFO L87 Difference]: Start difference. First operand 505523 states and 554820 transitions. Second operand 3 states. [2018-11-06 20:01:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:04,929 INFO L93 Difference]: Finished difference Result 921579 states and 1012002 transitions. [2018-11-06 20:01:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:01:04,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-11-06 20:01:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:05,421 INFO L225 Difference]: With dead ends: 921579 [2018-11-06 20:01:05,421 INFO L226 Difference]: Without dead ends: 416058 [2018-11-06 20:01:05,534 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 20:01:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416058 states. [2018-11-06 20:01:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416058 to 416042. [2018-11-06 20:01:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416042 states. [2018-11-06 20:01:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416042 states to 416042 states and 448273 transitions. [2018-11-06 20:01:10,529 INFO L78 Accepts]: Start accepts. Automaton has 416042 states and 448273 transitions. Word has length 391 [2018-11-06 20:01:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:10,530 INFO L480 AbstractCegarLoop]: Abstraction has 416042 states and 448273 transitions. [2018-11-06 20:01:10,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:01:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 416042 states and 448273 transitions. [2018-11-06 20:01:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-06 20:01:10,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:10,584 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:01:10,584 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:10,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1913922487, now seen corresponding path program 1 times [2018-11-06 20:01:10,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:10,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:10,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:10,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:10,925 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 20:01:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-06 20:01:12,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:01:12,075 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 20:01:12,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:12,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:01:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-06 20:01:12,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:01:12,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-06 20:01:12,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:01:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:01:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:01:12,400 INFO L87 Difference]: Start difference. First operand 416042 states and 448273 transitions. Second operand 4 states. [2018-11-06 20:01:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:18,044 INFO L93 Difference]: Finished difference Result 1155885 states and 1237531 transitions. [2018-11-06 20:01:18,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:01:18,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-06 20:01:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:19,926 INFO L225 Difference]: With dead ends: 1155885 [2018-11-06 20:01:19,926 INFO L226 Difference]: Without dead ends: 739845 [2018-11-06 20:01:20,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 397 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 20:01:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739845 states. [2018-11-06 20:01:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739845 to 588781. [2018-11-06 20:01:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588781 states. [2018-11-06 20:01:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588781 states to 588781 states and 627298 transitions. [2018-11-06 20:01:29,472 INFO L78 Accepts]: Start accepts. Automaton has 588781 states and 627298 transitions. Word has length 396 [2018-11-06 20:01:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:29,472 INFO L480 AbstractCegarLoop]: Abstraction has 588781 states and 627298 transitions. [2018-11-06 20:01:29,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:01:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 588781 states and 627298 transitions. [2018-11-06 20:01:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-06 20:01:29,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:29,533 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:29,533 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:29,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash 301252508, now seen corresponding path program 1 times [2018-11-06 20:01:29,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:29,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:29,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:29,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 20:01:29,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:01:29,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:01:29,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:01:29,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:01:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:01:29,749 INFO L87 Difference]: Start difference. First operand 588781 states and 627298 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 20:01:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:01:30,011 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 20:01:30,017 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 20:01:30,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:01:30 BoogieIcfgContainer [2018-11-06 20:01:30,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 20:01:30,018 INFO L168 Benchmark]: Toolchain (without parser) took 201456.09 ms. Allocated memory was 1.6 GB in the beginning and 6.1 GB in the end (delta: 4.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -252.2 MB). Peak memory consumption was 4.3 GB. Max. memory is 7.1 GB. [2018-11-06 20:01:30,019 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 20:01:30,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1183.43 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 20:01:30,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.14 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -873.8 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2018-11-06 20:01:30,020 INFO L168 Benchmark]: Boogie Preprocessor took 161.36 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 20:01:30,021 INFO L168 Benchmark]: RCFGBuilder took 5589.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 270.6 MB). Peak memory consumption was 270.6 MB. Max. memory is 7.1 GB. [2018-11-06 20:01:30,021 INFO L168 Benchmark]: TraceAbstraction took 194211.85 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.7 GB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 277.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-11-06 20:01:30,032 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.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1183.43 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 304.14 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -873.8 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.36 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5589.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 270.6 MB). Peak memory consumption was 270.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194211.85 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.7 GB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 277.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1638]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1638). Cancelled while BasicCegarLoop was constructing difference of abstraction (588781states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (350 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.1s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 104.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7334 SDtfs, 13511 SDslu, 6663 SDs, 0 SdLazy, 19291 SolverSat, 3811 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 984 GetRequests, 933 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588781occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 78.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 727195 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 7767 NumberOfCodeBlocks, 7767 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7741 ConstructedInterpolants, 0 QuantifiedInterpolants, 4070633 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1684 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 3721/3741 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown