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_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:57:34,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:57:34,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:57:34,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:57:34,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:57:34,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:57:34,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:57:34,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:57:34,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:57:34,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:57:34,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:57:34,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:57:34,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:57:34,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:57:34,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:57:34,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:57:34,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:57:34,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:57:34,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:57:34,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:57:34,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:57:34,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:57:34,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:57:34,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:57:34,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:57:34,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:57:34,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:57:34,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:57:34,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:57:34,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:57:34,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:57:34,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:57:34,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:57:34,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:57:34,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:57:34,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:57:34,709 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:57:34,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:57:34,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:57:34,740 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:57:34,740 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:57:34,740 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:57:34,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:57:34,741 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:57:34,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:57:34,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:57:34,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:57:34,743 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:57:34,743 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:57:34,743 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:57:34,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:57:34,744 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:57:34,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:57:34,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:57:34,744 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:57:34,744 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:57:34,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:57:34,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:57:34,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:57:34,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:57:34,747 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:57:34,747 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:57:34,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:57:34,747 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:57:34,747 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:57:34,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:57:34,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:57:34,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:57:34,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:57:34,822 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:57:34,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label34_true-unreach-call.c [2018-11-06 19:57:34,870 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc7c2f69/497e4d0ab1dc4fda9911633aadd1a2c4/FLAGc9df234c2 [2018-11-06 19:57:35,499 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:57:35,500 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label34_true-unreach-call.c [2018-11-06 19:57:35,522 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc7c2f69/497e4d0ab1dc4fda9911633aadd1a2c4/FLAGc9df234c2 [2018-11-06 19:57:35,544 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc7c2f69/497e4d0ab1dc4fda9911633aadd1a2c4 [2018-11-06 19:57:35,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:57:35,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:57:35,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:57:35,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:57:35,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:57:35,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:57:35" (1/1) ... [2018-11-06 19:57:35,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c639f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:35, skipping insertion in model container [2018-11-06 19:57:35,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:57:35" (1/1) ... [2018-11-06 19:57:35,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:57:35,685 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:57:36,383 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:57:36,389 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:57:36,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:57:36,751 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:57:36,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36 WrapperNode [2018-11-06 19:57:36,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:57:36,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:57:36,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:57:36,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:57:36,764 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:57:36" (1/1) ... [2018-11-06 19:57:36,956 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:57:36" (1/1) ... [2018-11-06 19:57:37,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:57:37,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:57:37,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:57:37,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:57:37,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (1/1) ... [2018-11-06 19:57:37,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:57:37,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:57:37,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:57:37,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:57:37,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (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:57:37,288 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:57:37,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:57:37,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:57:42,224 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:57:42,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:57:42 BoogieIcfgContainer [2018-11-06 19:57:42,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:57:42,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:57:42,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:57:42,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:57:42,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:57:35" (1/3) ... [2018-11-06 19:57:42,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2825ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:57:42, skipping insertion in model container [2018-11-06 19:57:42,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:36" (2/3) ... [2018-11-06 19:57:42,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2825ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:57:42, skipping insertion in model container [2018-11-06 19:57:42,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:57:42" (3/3) ... [2018-11-06 19:57:42,235 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label34_true-unreach-call.c [2018-11-06 19:57:42,245 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:57:42,255 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:57:42,273 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:57:42,311 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:57:42,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:57:42,312 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:57:42,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:57:42,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:57:42,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:57:42,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:57:42,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:57:42,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:57:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:57:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-06 19:57:42,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:42,361 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] [2018-11-06 19:57:42,364 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:42,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1912700218, now seen corresponding path program 1 times [2018-11-06 19:57:42,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:42,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:42,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:42,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:43,261 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:57:43,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:43,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:57:43,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:43,290 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-11-06 19:57:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:45,666 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-11-06 19:57:45,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:57:45,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-11-06 19:57:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:45,690 INFO L225 Difference]: With dead ends: 832 [2018-11-06 19:57:45,690 INFO L226 Difference]: Without dead ends: 525 [2018-11-06 19:57:45,696 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:57:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-11-06 19:57:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-11-06 19:57:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-11-06 19:57:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-11-06 19:57:45,779 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 191 [2018-11-06 19:57:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:45,781 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-11-06 19:57:45,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:57:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-11-06 19:57:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-06 19:57:45,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:45,788 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] [2018-11-06 19:57:45,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:45,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1131928361, now seen corresponding path program 1 times [2018-11-06 19:57:45,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:45,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:45,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:45,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:45,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:46,117 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:57:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:46,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:57:46,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:46,125 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-11-06 19:57:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:51,116 INFO L93 Difference]: Finished difference Result 1892 states and 3348 transitions. [2018-11-06 19:57:51,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:57:51,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-06 19:57:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:51,127 INFO L225 Difference]: With dead ends: 1892 [2018-11-06 19:57:51,127 INFO L226 Difference]: Without dead ends: 1383 [2018-11-06 19:57:51,131 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:57:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-11-06 19:57:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 923. [2018-11-06 19:57:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-06 19:57:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-11-06 19:57:51,174 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 197 [2018-11-06 19:57:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:51,175 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-11-06 19:57:51,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-11-06 19:57:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-06 19:57:51,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:51,181 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:57:51,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:51,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:51,182 INFO L82 PathProgramCache]: Analyzing trace with hash -292852035, now seen corresponding path program 1 times [2018-11-06 19:57:51,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:51,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:51,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:57:51,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:51,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:57:51,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:51,325 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-11-06 19:57:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:52,316 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-11-06 19:57:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:57:52,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-06 19:57:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:52,326 INFO L225 Difference]: With dead ends: 1823 [2018-11-06 19:57:52,326 INFO L226 Difference]: Without dead ends: 902 [2018-11-06 19:57:52,329 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:57:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-11-06 19:57:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-11-06 19:57:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-11-06 19:57:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-11-06 19:57:52,357 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 205 [2018-11-06 19:57:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:52,357 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-11-06 19:57:52,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:57:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-11-06 19:57:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-06 19:57:52,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:52,362 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:52,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:52,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1441741858, now seen corresponding path program 1 times [2018-11-06 19:57:52,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:52,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 19:57:52,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:52,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:57:52,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:52,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:52,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:52,612 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-11-06 19:57:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:54,757 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-11-06 19:57:54,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:57:54,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-11-06 19:57:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:54,771 INFO L225 Difference]: With dead ends: 3476 [2018-11-06 19:57:54,771 INFO L226 Difference]: Without dead ends: 2576 [2018-11-06 19:57:54,774 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:57:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-11-06 19:57:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-11-06 19:57:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-11-06 19:57:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-11-06 19:57:54,818 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 207 [2018-11-06 19:57:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:54,818 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-11-06 19:57:54,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-11-06 19:57:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-06 19:57:54,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:54,824 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] [2018-11-06 19:57:54,825 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:54,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1233483722, now seen corresponding path program 1 times [2018-11-06 19:57:54,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:54,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:55,010 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:57:55,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:55,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:57:55,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:55,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:55,012 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-11-06 19:57:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:55,550 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-11-06 19:57:55,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:57:55,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-06 19:57:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:55,565 INFO L225 Difference]: With dead ends: 5159 [2018-11-06 19:57:55,566 INFO L226 Difference]: Without dead ends: 3438 [2018-11-06 19:57:55,568 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:57:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-11-06 19:57:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-11-06 19:57:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-11-06 19:57:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-11-06 19:57:55,633 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 214 [2018-11-06 19:57:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:55,633 INFO L480 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-11-06 19:57:55,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:57:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-11-06 19:57:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-06 19:57:55,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:55,640 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] [2018-11-06 19:57:55,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:55,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash 37302206, now seen corresponding path program 1 times [2018-11-06 19:57:55,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:55,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:55,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:55,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:55,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:56,163 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:57:56,215 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:57:56,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:56,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:57:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:57:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:57:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:57:56,217 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-11-06 19:57:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:59,239 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-11-06 19:57:59,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:57:59,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2018-11-06 19:57:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:59,257 INFO L225 Difference]: With dead ends: 7939 [2018-11-06 19:57:59,257 INFO L226 Difference]: Without dead ends: 4505 [2018-11-06 19:57:59,262 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:57:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-11-06 19:57:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-11-06 19:57:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-11-06 19:57:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-11-06 19:57:59,334 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 231 [2018-11-06 19:57:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:59,335 INFO L480 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-11-06 19:57:59,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:57:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-11-06 19:57:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-06 19:57:59,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:59,343 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:59,343 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:59,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2040757814, now seen corresponding path program 1 times [2018-11-06 19:57:59,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:59,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:57:59,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:59,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:57:59,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:59,559 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-11-06 19:58:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:00,983 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-11-06 19:58:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:00,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-06 19:58:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:01,002 INFO L225 Difference]: With dead ends: 8933 [2018-11-06 19:58:01,003 INFO L226 Difference]: Without dead ends: 5295 [2018-11-06 19:58:01,007 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:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-11-06 19:58:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-11-06 19:58:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-11-06 19:58:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-11-06 19:58:01,091 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 233 [2018-11-06 19:58:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:01,092 INFO L480 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-11-06 19:58:01,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-11-06 19:58:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-06 19:58:01,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:01,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,102 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:01,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -408667746, now seen corresponding path program 1 times [2018-11-06 19:58:01,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:01,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:01,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:01,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:01,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:01,559 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:58:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:01,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:01,613 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:01,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:01,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:02,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:02,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:58:02,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:58:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:58:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:58:02,290 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 8 states. [2018-11-06 19:58:02,602 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-06 19:58:03,178 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:58:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:10,040 INFO L93 Difference]: Finished difference Result 23470 states and 34139 transitions. [2018-11-06 19:58:10,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 19:58:10,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2018-11-06 19:58:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:10,104 INFO L225 Difference]: With dead ends: 23470 [2018-11-06 19:58:10,104 INFO L226 Difference]: Without dead ends: 18179 [2018-11-06 19:58:10,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:58:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18179 states. [2018-11-06 19:58:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18179 to 17765. [2018-11-06 19:58:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17765 states. [2018-11-06 19:58:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 22455 transitions. [2018-11-06 19:58:10,578 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 22455 transitions. Word has length 241 [2018-11-06 19:58:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:10,578 INFO L480 AbstractCegarLoop]: Abstraction has 17765 states and 22455 transitions. [2018-11-06 19:58:10,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:58:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 22455 transitions. [2018-11-06 19:58:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-06 19:58:10,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:10,607 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,607 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:10,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash -533869373, now seen corresponding path program 1 times [2018-11-06 19:58:10,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 19:58:10,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:10,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:10,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:10,765 INFO L87 Difference]: Start difference. First operand 17765 states and 22455 transitions. Second operand 3 states. [2018-11-06 19:58:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:12,574 INFO L93 Difference]: Finished difference Result 47563 states and 59766 transitions. [2018-11-06 19:58:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:12,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-11-06 19:58:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:12,631 INFO L225 Difference]: With dead ends: 47563 [2018-11-06 19:58:12,631 INFO L226 Difference]: Without dead ends: 29800 [2018-11-06 19:58:12,652 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:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29800 states. [2018-11-06 19:58:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29800 to 29798. [2018-11-06 19:58:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29798 states. [2018-11-06 19:58:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29798 states to 29798 states and 35718 transitions. [2018-11-06 19:58:13,078 INFO L78 Accepts]: Start accepts. Automaton has 29798 states and 35718 transitions. Word has length 287 [2018-11-06 19:58:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:13,079 INFO L480 AbstractCegarLoop]: Abstraction has 29798 states and 35718 transitions. [2018-11-06 19:58:13,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 29798 states and 35718 transitions. [2018-11-06 19:58:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-06 19:58:13,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:13,118 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,118 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:13,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1021598578, now seen corresponding path program 1 times [2018-11-06 19:58:13,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:13,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:13,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:13,435 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:58:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 19:58:13,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:13,513 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:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:13,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-06 19:58:13,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:13,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 19:58:13,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:58:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:58:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:58:13,855 INFO L87 Difference]: Start difference. First operand 29798 states and 35718 transitions. Second operand 5 states. [2018-11-06 19:58:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:16,712 INFO L93 Difference]: Finished difference Result 64902 states and 77632 transitions. [2018-11-06 19:58:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:16,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-11-06 19:58:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:16,754 INFO L225 Difference]: With dead ends: 64902 [2018-11-06 19:58:16,755 INFO L226 Difference]: Without dead ends: 35106 [2018-11-06 19:58:16,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:58:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35106 states. [2018-11-06 19:58:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35106 to 33470. [2018-11-06 19:58:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33470 states. [2018-11-06 19:58:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33470 states to 33470 states and 38880 transitions. [2018-11-06 19:58:17,198 INFO L78 Accepts]: Start accepts. Automaton has 33470 states and 38880 transitions. Word has length 300 [2018-11-06 19:58:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:17,199 INFO L480 AbstractCegarLoop]: Abstraction has 33470 states and 38880 transitions. [2018-11-06 19:58:17,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:58:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33470 states and 38880 transitions. [2018-11-06 19:58:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-06 19:58:17,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:17,234 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-06 19:58:17,234 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:17,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2132467535, now seen corresponding path program 1 times [2018-11-06 19:58:17,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:17,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 19:58:17,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:17,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:17,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:17,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:17,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:17,505 INFO L87 Difference]: Start difference. First operand 33470 states and 38880 transitions. Second operand 4 states. [2018-11-06 19:58:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:19,421 INFO L93 Difference]: Finished difference Result 103829 states and 120196 transitions. [2018-11-06 19:58:19,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:19,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-11-06 19:58:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:19,507 INFO L225 Difference]: With dead ends: 103829 [2018-11-06 19:58:19,507 INFO L226 Difference]: Without dead ends: 70361 [2018-11-06 19:58:19,539 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:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-11-06 19:58:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 70357. [2018-11-06 19:58:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70357 states. [2018-11-06 19:58:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70357 states to 70357 states and 80068 transitions. [2018-11-06 19:58:20,751 INFO L78 Accepts]: Start accepts. Automaton has 70357 states and 80068 transitions. Word has length 308 [2018-11-06 19:58:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:20,751 INFO L480 AbstractCegarLoop]: Abstraction has 70357 states and 80068 transitions. [2018-11-06 19:58:20,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 70357 states and 80068 transitions. [2018-11-06 19:58:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-06 19:58:20,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:20,778 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,778 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:20,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1792595925, now seen corresponding path program 1 times [2018-11-06 19:58:20,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:20,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:58:21,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:21,017 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 19:58:21,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:21,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:58:21,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:21,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:58:21,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:58:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:58:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:58:21,309 INFO L87 Difference]: Start difference. First operand 70357 states and 80068 transitions. Second operand 7 states. [2018-11-06 19:58:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:27,984 INFO L93 Difference]: Finished difference Result 246247 states and 279293 transitions. [2018-11-06 19:58:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:58:27,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 331 [2018-11-06 19:58:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:28,201 INFO L225 Difference]: With dead ends: 246247 [2018-11-06 19:58:28,201 INFO L226 Difference]: Without dead ends: 175891 [2018-11-06 19:58:28,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:58:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175891 states. [2018-11-06 19:58:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175891 to 166469. [2018-11-06 19:58:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166469 states. [2018-11-06 19:58:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166469 states to 166469 states and 186010 transitions. [2018-11-06 19:58:29,742 INFO L78 Accepts]: Start accepts. Automaton has 166469 states and 186010 transitions. Word has length 331 [2018-11-06 19:58:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:29,742 INFO L480 AbstractCegarLoop]: Abstraction has 166469 states and 186010 transitions. [2018-11-06 19:58:29,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:58:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 166469 states and 186010 transitions. [2018-11-06 19:58:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-06 19:58:29,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:29,770 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:29,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash 827616549, now seen corresponding path program 1 times [2018-11-06 19:58:29,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:29,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:29,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 19:58:30,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:30,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:30,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:30,159 INFO L87 Difference]: Start difference. First operand 166469 states and 186010 transitions. Second operand 4 states. [2018-11-06 19:58:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:33,929 INFO L93 Difference]: Finished difference Result 476196 states and 530997 transitions. [2018-11-06 19:58:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:33,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-11-06 19:58:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:34,292 INFO L225 Difference]: With dead ends: 476196 [2018-11-06 19:58:34,292 INFO L226 Difference]: Without dead ends: 309729 [2018-11-06 19:58:34,407 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:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309729 states. [2018-11-06 19:58:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309729 to 240274. [2018-11-06 19:58:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240274 states. [2018-11-06 19:58:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240274 states to 240274 states and 265833 transitions. [2018-11-06 19:58:38,031 INFO L78 Accepts]: Start accepts. Automaton has 240274 states and 265833 transitions. Word has length 336 [2018-11-06 19:58:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:38,032 INFO L480 AbstractCegarLoop]: Abstraction has 240274 states and 265833 transitions. [2018-11-06 19:58:38,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 240274 states and 265833 transitions. [2018-11-06 19:58:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-06 19:58:38,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:38,079 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,080 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:38,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:38,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1229916392, now seen corresponding path program 1 times [2018-11-06 19:58:38,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:38,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:38,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:38,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:38,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-06 19:58:38,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:38,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:38,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:38,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:38,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:38,344 INFO L87 Difference]: Start difference. First operand 240274 states and 265833 transitions. Second operand 3 states. [2018-11-06 19:58:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:40,611 INFO L93 Difference]: Finished difference Result 480536 states and 531654 transitions. [2018-11-06 19:58:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:40,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2018-11-06 19:58:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:40,876 INFO L225 Difference]: With dead ends: 480536 [2018-11-06 19:58:40,876 INFO L226 Difference]: Without dead ends: 240264 [2018-11-06 19:58:40,976 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:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240264 states. [2018-11-06 19:58:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240264 to 240264. [2018-11-06 19:58:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240264 states. [2018-11-06 19:58:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240264 states to 240264 states and 265806 transitions. [2018-11-06 19:58:49,764 INFO L78 Accepts]: Start accepts. Automaton has 240264 states and 265806 transitions. Word has length 364 [2018-11-06 19:58:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:49,764 INFO L480 AbstractCegarLoop]: Abstraction has 240264 states and 265806 transitions. [2018-11-06 19:58:49,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 240264 states and 265806 transitions. [2018-11-06 19:58:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-06 19:58:49,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:49,798 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:58:49,798 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:49,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1039226532, now seen corresponding path program 1 times [2018-11-06 19:58:49,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:49,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:49,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:49,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:49,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-06 19:58:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:50,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:50,320 INFO L87 Difference]: Start difference. First operand 240264 states and 265806 transitions. Second operand 4 states. [2018-11-06 19:58:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:54,890 INFO L93 Difference]: Finished difference Result 870276 states and 960747 transitions. [2018-11-06 19:58:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:54,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-11-06 19:58:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:55,782 INFO L225 Difference]: With dead ends: 870276 [2018-11-06 19:58:55,782 INFO L226 Difference]: Without dead ends: 630014 [2018-11-06 19:58:55,952 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:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630014 states. [2018-11-06 19:59:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630014 to 400371. [2018-11-06 19:59:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400371 states. [2018-11-06 19:59:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400371 states to 400371 states and 440874 transitions. [2018-11-06 19:59:03,687 INFO L78 Accepts]: Start accepts. Automaton has 400371 states and 440874 transitions. Word has length 365 [2018-11-06 19:59:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:03,688 INFO L480 AbstractCegarLoop]: Abstraction has 400371 states and 440874 transitions. [2018-11-06 19:59:03,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 400371 states and 440874 transitions. [2018-11-06 19:59:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-06 19:59:03,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:03,724 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:59:03,724 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:03,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1352077086, now seen corresponding path program 1 times [2018-11-06 19:59:03,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:03,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:03,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:04,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:04,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:04,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:04,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:04,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:04,137 INFO L87 Difference]: Start difference. First operand 400371 states and 440874 transitions. Second operand 4 states. [2018-11-06 19:59:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:15,365 INFO L93 Difference]: Finished difference Result 804023 states and 885545 transitions. [2018-11-06 19:59:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:15,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-11-06 19:59:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:16,036 INFO L225 Difference]: With dead ends: 804023 [2018-11-06 19:59:16,037 INFO L226 Difference]: Without dead ends: 403654 [2018-11-06 19:59:16,204 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 19:59:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403654 states. [2018-11-06 19:59:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403654 to 402812. [2018-11-06 19:59:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402812 states. [2018-11-06 19:59:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402812 states to 402812 states and 440653 transitions. [2018-11-06 19:59:21,502 INFO L78 Accepts]: Start accepts. Automaton has 402812 states and 440653 transitions. Word has length 365 [2018-11-06 19:59:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:21,502 INFO L480 AbstractCegarLoop]: Abstraction has 402812 states and 440653 transitions. [2018-11-06 19:59:21,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 402812 states and 440653 transitions. [2018-11-06 19:59:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-06 19:59:21,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:21,540 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21,540 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 612074820, now seen corresponding path program 1 times [2018-11-06 19:59:21,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:21,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 19:59:21,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:21,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:21,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:21,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:21,964 INFO L87 Difference]: Start difference. First operand 402812 states and 440653 transitions. Second operand 4 states. [2018-11-06 19:59:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:28,725 INFO L93 Difference]: Finished difference Result 805622 states and 881304 transitions. [2018-11-06 19:59:28,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:28,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-11-06 19:59:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:29,266 INFO L225 Difference]: With dead ends: 805622 [2018-11-06 19:59:29,267 INFO L226 Difference]: Without dead ends: 402812 [2018-11-06 19:59:29,417 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:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402812 states. [2018-11-06 19:59:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402812 to 402812. [2018-11-06 19:59:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402812 states. [2018-11-06 19:59:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402812 states to 402812 states and 440450 transitions. [2018-11-06 19:59:34,944 INFO L78 Accepts]: Start accepts. Automaton has 402812 states and 440450 transitions. Word has length 365 [2018-11-06 19:59:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:34,945 INFO L480 AbstractCegarLoop]: Abstraction has 402812 states and 440450 transitions. [2018-11-06 19:59:34,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 402812 states and 440450 transitions. [2018-11-06 19:59:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-11-06 19:59:34,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:34,990 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,990 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:34,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1143744569, now seen corresponding path program 1 times [2018-11-06 19:59:34,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 19:59:35,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:35,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:35,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:35,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:35,383 INFO L87 Difference]: Start difference. First operand 402812 states and 440450 transitions. Second operand 4 states. [2018-11-06 19:59:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:48,683 INFO L93 Difference]: Finished difference Result 1370537 states and 1494917 transitions. [2018-11-06 19:59:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:48,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2018-11-06 19:59:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:49,945 INFO L225 Difference]: With dead ends: 1370537 [2018-11-06 19:59:49,946 INFO L226 Difference]: Without dead ends: 967727 [2018-11-06 19:59:50,196 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 19:59:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967727 states. [2018-11-06 19:59:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967727 to 632184. [2018-11-06 19:59:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632184 states. [2018-11-06 20:00:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632184 states to 632184 states and 687004 transitions. [2018-11-06 20:00:00,479 INFO L78 Accepts]: Start accepts. Automaton has 632184 states and 687004 transitions. Word has length 369 [2018-11-06 20:00:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:00,480 INFO L480 AbstractCegarLoop]: Abstraction has 632184 states and 687004 transitions. [2018-11-06 20:00:00,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 632184 states and 687004 transitions. [2018-11-06 20:00:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-11-06 20:00:00,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:00,529 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:00,529 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:00,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:00,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1403139758, now seen corresponding path program 1 times [2018-11-06 20:00:00,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:00,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-06 20:00:02,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:02,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:02,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:02,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:02,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:02,155 INFO L87 Difference]: Start difference. First operand 632184 states and 687004 transitions. Second operand 4 states. [2018-11-06 20:00:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:09,500 INFO L93 Difference]: Finished difference Result 1283449 states and 1396506 transitions. [2018-11-06 20:00:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:09,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-11-06 20:00:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:10,360 INFO L225 Difference]: With dead ends: 1283449 [2018-11-06 20:00:10,360 INFO L226 Difference]: Without dead ends: 629755 [2018-11-06 20:00:11,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629755 states. [2018-11-06 20:00:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629755 to 605700. [2018-11-06 20:00:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605700 states. [2018-11-06 20:00:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605700 states to 605700 states and 653159 transitions. [2018-11-06 20:00:29,709 INFO L78 Accepts]: Start accepts. Automaton has 605700 states and 653159 transitions. Word has length 380 [2018-11-06 20:00:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:29,709 INFO L480 AbstractCegarLoop]: Abstraction has 605700 states and 653159 transitions. [2018-11-06 20:00:29,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 605700 states and 653159 transitions. [2018-11-06 20:00:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-06 20:00:29,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:29,764 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:29,764 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:29,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1388378923, now seen corresponding path program 1 times [2018-11-06 20:00:29,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:29,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:30,181 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 20:00:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 193 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:32,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:32,035 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:32,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:32,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 20:00:32,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 20:00:32,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 20:00:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 20:00:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-06 20:00:32,468 INFO L87 Difference]: Start difference. First operand 605700 states and 653159 transitions. Second operand 10 states. [2018-11-06 20:00:36,788 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-06 20:00:41,658 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 Received shutdown request... [2018-11-06 20:00:59,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-06 20:00:59,421 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 20:00:59,425 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 20:00:59,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:00:59 BoogieIcfgContainer [2018-11-06 20:00:59,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 20:00:59,427 INFO L168 Benchmark]: Toolchain (without parser) took 203870.54 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.1 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. [2018-11-06 20:00:59,428 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 20:00:59,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1193.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 20:00:59,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 328.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.2 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2018-11-06 20:00:59,430 INFO L168 Benchmark]: Boogie Preprocessor took 134.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-11-06 20:00:59,431 INFO L168 Benchmark]: RCFGBuilder took 5009.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.7 MB). Peak memory consumption was 268.7 MB. Max. memory is 7.1 GB. [2018-11-06 20:00:59,432 INFO L168 Benchmark]: TraceAbstraction took 197198.97 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.4 GB). Free memory was 1.9 GB in the beginning and 2.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-11-06 20:00:59,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1193.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 328.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.2 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5009.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.7 MB). Peak memory consumption was 268.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197198.97 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.4 GB). Free memory was 1.9 GB in the beginning and 2.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1605]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1605). Cancelled while BasicCegarLoop was constructing difference of abstraction (605700states) and FLOYD_HOARE automaton (currently 30 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2065035 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 197.1s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 120.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4988 SDtfs, 19966 SDslu, 5741 SDs, 0 SdLazy, 29262 SolverSat, 5389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1377 GetRequests, 1289 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632184occurred in iteration=18, 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: 63.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 673212 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 7125 NumberOfCodeBlocks, 7125 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7101 ConstructedInterpolants, 0 QuantifiedInterpolants, 5646847 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2268 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 4128/4197 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown