/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:04:11,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:04:11,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:04:11,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:04:11,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:04:11,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:04:11,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:04:11,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:04:11,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:04:11,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:04:11,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:04:11,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:04:11,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:04:11,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:04:11,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:04:11,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:04:11,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:04:11,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:04:11,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:04:11,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:04:11,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:04:11,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:04:11,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:04:11,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:04:11,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:04:11,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:04:11,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:04:11,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:04:11,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:04:11,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:04:11,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:04:11,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:04:11,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:04:11,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:04:11,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:04:11,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:04:11,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:04:11,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:04:11,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:04:11,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:04:11,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:04:11,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:04:11,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:04:11,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:04:11,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:04:11,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:04:11,687 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:04:11,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:04:11,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:04:11,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:04:11,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:04:11,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:04:11,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:04:11,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:04:11,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:04:11,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:04:11,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:04:11,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:04:11,690 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:04:11,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:04:11,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:04:11,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:04:11,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:04:11,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:04:11,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:04:11,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:04:11,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:04:11,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:04:11,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:04:11,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:04:11,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:04:11,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:04:11,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:04:11,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:04:11,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:04:11,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:04:11,981 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:04:11,982 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56.c [2019-11-23 21:04:12,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb49133/115d5bce37ec48beba7599ecfbb03f86/FLAG4a7af821e [2019-11-23 21:04:12,645 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:04:12,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label56.c [2019-11-23 21:04:12,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb49133/115d5bce37ec48beba7599ecfbb03f86/FLAG4a7af821e [2019-11-23 21:04:12,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3eb49133/115d5bce37ec48beba7599ecfbb03f86 [2019-11-23 21:04:12,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:04:12,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:04:12,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:04:12,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:04:12,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:04:12,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:04:12" (1/1) ... [2019-11-23 21:04:12,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3a48d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:12, skipping insertion in model container [2019-11-23 21:04:12,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:04:12" (1/1) ... [2019-11-23 21:04:12,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:04:12,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:04:13,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:04:13,481 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:04:13,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:04:13,646 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:04:13,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13 WrapperNode [2019-11-23 21:04:13,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:04:13,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:04:13,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:04:13,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:04:13,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:04:13,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:04:13,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:04:13,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:04:13,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (1/1) ... [2019-11-23 21:04:13,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:04:13,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:04:13,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:04:13,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:04:13,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (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 [2019-11-23 21:04:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:04:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:04:15,310 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:04:15,311 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:04:15,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:15 BoogieIcfgContainer [2019-11-23 21:04:15,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:04:15,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:04:15,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:04:15,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:04:15,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:04:12" (1/3) ... [2019-11-23 21:04:15,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ccca1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:15, skipping insertion in model container [2019-11-23 21:04:15,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:13" (2/3) ... [2019-11-23 21:04:15,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ccca1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:15, skipping insertion in model container [2019-11-23 21:04:15,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:15" (3/3) ... [2019-11-23 21:04:15,323 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label56.c [2019-11-23 21:04:15,336 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:04:15,345 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:04:15,361 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:04:15,405 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:04:15,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:04:15,406 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:04:15,406 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:04:15,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:04:15,407 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:04:15,407 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:04:15,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:04:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-23 21:04:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 21:04:15,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:15,451 INFO L410 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] [2019-11-23 21:04:15,452 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:15,459 INFO L82 PathProgramCache]: Analyzing trace with hash -573341295, now seen corresponding path program 1 times [2019-11-23 21:04:15,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:15,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806810693] [2019-11-23 21:04:15,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:15,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806810693] [2019-11-23 21:04:15,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:15,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:15,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576885363] [2019-11-23 21:04:15,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:15,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:15,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:15,780 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-23 21:04:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:17,172 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-23 21:04:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:17,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-23 21:04:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:17,191 INFO L225 Difference]: With dead ends: 694 [2019-11-23 21:04:17,191 INFO L226 Difference]: Without dead ends: 421 [2019-11-23 21:04:17,196 INFO L630 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 [2019-11-23 21:04:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-23 21:04:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-11-23 21:04:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-23 21:04:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-23 21:04:17,272 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 23 [2019-11-23 21:04:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:17,273 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-23 21:04:17,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-23 21:04:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-23 21:04:17,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:17,277 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:04:17,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1981617417, now seen corresponding path program 1 times [2019-11-23 21:04:17,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:17,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311488068] [2019-11-23 21:04:17,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:17,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311488068] [2019-11-23 21:04:17,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:17,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:17,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846642711] [2019-11-23 21:04:17,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:17,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:17,547 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-11-23 21:04:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:18,599 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-11-23 21:04:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:18,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-23 21:04:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:18,604 INFO L225 Difference]: With dead ends: 840 [2019-11-23 21:04:18,604 INFO L226 Difference]: Without dead ends: 560 [2019-11-23 21:04:18,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-23 21:04:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-11-23 21:04:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-23 21:04:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-11-23 21:04:18,632 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 92 [2019-11-23 21:04:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:18,633 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-11-23 21:04:18,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-11-23 21:04:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 21:04:18,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:18,636 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:04:18,636 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2055444920, now seen corresponding path program 1 times [2019-11-23 21:04:18,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:18,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196075391] [2019-11-23 21:04:18,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:18,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196075391] [2019-11-23 21:04:18,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:18,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:18,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500697780] [2019-11-23 21:04:18,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:18,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:18,735 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 4 states. [2019-11-23 21:04:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:19,720 INFO L93 Difference]: Finished difference Result 1535 states and 2162 transitions. [2019-11-23 21:04:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:19,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 21:04:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:19,733 INFO L225 Difference]: With dead ends: 1535 [2019-11-23 21:04:19,733 INFO L226 Difference]: Without dead ends: 1116 [2019-11-23 21:04:19,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-23 21:04:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-11-23 21:04:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-23 21:04:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1093 transitions. [2019-11-23 21:04:19,765 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1093 transitions. Word has length 98 [2019-11-23 21:04:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:19,765 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1093 transitions. [2019-11-23 21:04:19,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1093 transitions. [2019-11-23 21:04:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 21:04:19,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:19,774 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:04:19,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1680739469, now seen corresponding path program 1 times [2019-11-23 21:04:19,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:19,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4595832] [2019-11-23 21:04:19,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:20,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4595832] [2019-11-23 21:04:20,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:20,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:20,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178999029] [2019-11-23 21:04:20,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:20,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:20,049 INFO L87 Difference]: Start difference. First operand 838 states and 1093 transitions. Second operand 4 states. [2019-11-23 21:04:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:20,958 INFO L93 Difference]: Finished difference Result 1813 states and 2363 transitions. [2019-11-23 21:04:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:20,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-23 21:04:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:20,965 INFO L225 Difference]: With dead ends: 1813 [2019-11-23 21:04:20,965 INFO L226 Difference]: Without dead ends: 977 [2019-11-23 21:04:20,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-23 21:04:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-23 21:04:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-23 21:04:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1167 transitions. [2019-11-23 21:04:20,997 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1167 transitions. Word has length 160 [2019-11-23 21:04:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:20,998 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1167 transitions. [2019-11-23 21:04:20,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1167 transitions. [2019-11-23 21:04:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 21:04:21,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:21,002 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:21,002 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1308448785, now seen corresponding path program 1 times [2019-11-23 21:04:21,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:21,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394239915] [2019-11-23 21:04:21,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-23 21:04:21,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394239915] [2019-11-23 21:04:21,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:21,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:21,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233040258] [2019-11-23 21:04:21,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:21,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:21,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:21,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:21,289 INFO L87 Difference]: Start difference. First operand 977 states and 1167 transitions. Second operand 5 states. [2019-11-23 21:04:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:22,859 INFO L93 Difference]: Finished difference Result 3622 states and 4322 transitions. [2019-11-23 21:04:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:22,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-11-23 21:04:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:22,874 INFO L225 Difference]: With dead ends: 3622 [2019-11-23 21:04:22,874 INFO L226 Difference]: Without dead ends: 2647 [2019-11-23 21:04:22,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-11-23 21:04:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1950. [2019-11-23 21:04:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-11-23 21:04:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2256 transitions. [2019-11-23 21:04:22,923 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2256 transitions. Word has length 192 [2019-11-23 21:04:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:22,924 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 2256 transitions. [2019-11-23 21:04:22,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2256 transitions. [2019-11-23 21:04:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-23 21:04:22,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:22,929 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:22,929 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:22,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1589151532, now seen corresponding path program 1 times [2019-11-23 21:04:22,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:22,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968694437] [2019-11-23 21:04:22,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:23,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968694437] [2019-11-23 21:04:23,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:23,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:04:23,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115719024] [2019-11-23 21:04:23,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:23,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:23,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:23,131 INFO L87 Difference]: Start difference. First operand 1950 states and 2256 transitions. Second operand 5 states. [2019-11-23 21:04:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:24,694 INFO L93 Difference]: Finished difference Result 5288 states and 6070 transitions. [2019-11-23 21:04:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:24,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-11-23 21:04:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:24,707 INFO L225 Difference]: With dead ends: 5288 [2019-11-23 21:04:24,708 INFO L226 Difference]: Without dead ends: 1950 [2019-11-23 21:04:24,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-23 21:04:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-11-23 21:04:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-23 21:04:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1832 transitions. [2019-11-23 21:04:24,764 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1832 transitions. Word has length 235 [2019-11-23 21:04:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:24,766 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1832 transitions. [2019-11-23 21:04:24,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1832 transitions. [2019-11-23 21:04:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-23 21:04:24,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:24,776 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 21:04:24,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:24,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash 433365790, now seen corresponding path program 1 times [2019-11-23 21:04:24,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:24,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433448757] [2019-11-23 21:04:24,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 69 proven. 141 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 21:04:25,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433448757] [2019-11-23 21:04:25,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798544928] [2019-11-23 21:04:25,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:25,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:04:25,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-11-23 21:04:25,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:04:25,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 21:04:25,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835122697] [2019-11-23 21:04:25,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:04:25,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:04:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:25,782 INFO L87 Difference]: Start difference. First operand 1672 states and 1832 transitions. Second operand 3 states. [2019-11-23 21:04:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:26,618 INFO L93 Difference]: Finished difference Result 4037 states and 4449 transitions. [2019-11-23 21:04:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:04:26,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-23 21:04:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:26,628 INFO L225 Difference]: With dead ends: 4037 [2019-11-23 21:04:26,628 INFO L226 Difference]: Without dead ends: 2367 [2019-11-23 21:04:26,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-23 21:04:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2019-11-23 21:04:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-11-23 21:04:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2577 transitions. [2019-11-23 21:04:26,692 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2577 transitions. Word has length 258 [2019-11-23 21:04:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:26,693 INFO L462 AbstractCegarLoop]: Abstraction has 2367 states and 2577 transitions. [2019-11-23 21:04:26,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:04:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2577 transitions. [2019-11-23 21:04:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 21:04:26,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:26,700 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:26,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:26,905 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 666553426, now seen corresponding path program 1 times [2019-11-23 21:04:26,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:26,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737445084] [2019-11-23 21:04:26,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:27,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737445084] [2019-11-23 21:04:27,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175077253] [2019-11-23 21:04:27,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:27,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:04:27,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:27,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:27,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:28,689 WARN L192 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-11-23 21:04:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:28,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:28,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-23 21:04:28,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424575836] [2019-11-23 21:04:28,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:04:28,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:04:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:28,942 INFO L87 Difference]: Start difference. First operand 2367 states and 2577 transitions. Second operand 7 states. [2019-11-23 21:04:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:31,385 INFO L93 Difference]: Finished difference Result 6539 states and 7142 transitions. [2019-11-23 21:04:31,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:04:31,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2019-11-23 21:04:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:31,404 INFO L225 Difference]: With dead ends: 6539 [2019-11-23 21:04:31,406 INFO L226 Difference]: Without dead ends: 4174 [2019-11-23 21:04:31,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2019-11-23 21:04:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 2923. [2019-11-23 21:04:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-11-23 21:04:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3162 transitions. [2019-11-23 21:04:31,477 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3162 transitions. Word has length 271 [2019-11-23 21:04:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:31,477 INFO L462 AbstractCegarLoop]: Abstraction has 2923 states and 3162 transitions. [2019-11-23 21:04:31,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:04:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3162 transitions. [2019-11-23 21:04:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-11-23 21:04:31,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:31,486 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:04:31,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:31,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash 960030519, now seen corresponding path program 1 times [2019-11-23 21:04:31,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:31,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156904902] [2019-11-23 21:04:31,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 21:04:31,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156904902] [2019-11-23 21:04:31,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324370762] [2019-11-23 21:04:31,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:32,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:04:32,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:32,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 21:04:32,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:32,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-23 21:04:32,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073858577] [2019-11-23 21:04:32,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:32,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:32,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:32,368 INFO L87 Difference]: Start difference. First operand 2923 states and 3162 transitions. Second operand 5 states. [2019-11-23 21:04:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:33,612 INFO L93 Difference]: Finished difference Result 6678 states and 7231 transitions. [2019-11-23 21:04:33,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:33,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 325 [2019-11-23 21:04:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:33,627 INFO L225 Difference]: With dead ends: 6678 [2019-11-23 21:04:33,627 INFO L226 Difference]: Without dead ends: 3757 [2019-11-23 21:04:33,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-11-23 21:04:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3340. [2019-11-23 21:04:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3340 states. [2019-11-23 21:04:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 3613 transitions. [2019-11-23 21:04:33,696 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 3613 transitions. Word has length 325 [2019-11-23 21:04:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:33,697 INFO L462 AbstractCegarLoop]: Abstraction has 3340 states and 3613 transitions. [2019-11-23 21:04:33,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 3613 transitions. [2019-11-23 21:04:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-11-23 21:04:33,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:33,709 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:33,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:33,914 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1084368801, now seen corresponding path program 1 times [2019-11-23 21:04:33,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:33,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804780757] [2019-11-23 21:04:33,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 21:04:34,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804780757] [2019-11-23 21:04:34,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:34,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:34,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650210243] [2019-11-23 21:04:34,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:34,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:34,193 INFO L87 Difference]: Start difference. First operand 3340 states and 3613 transitions. Second operand 4 states. [2019-11-23 21:04:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:35,527 INFO L93 Difference]: Finished difference Result 7095 states and 7688 transitions. [2019-11-23 21:04:35,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:35,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2019-11-23 21:04:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:35,548 INFO L225 Difference]: With dead ends: 7095 [2019-11-23 21:04:35,548 INFO L226 Difference]: Without dead ends: 3896 [2019-11-23 21:04:35,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2019-11-23 21:04:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3757. [2019-11-23 21:04:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-11-23 21:04:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 4037 transitions. [2019-11-23 21:04:35,673 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 4037 transitions. Word has length 410 [2019-11-23 21:04:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:35,674 INFO L462 AbstractCegarLoop]: Abstraction has 3757 states and 4037 transitions. [2019-11-23 21:04:35,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 4037 transitions. [2019-11-23 21:04:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-23 21:04:35,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:35,695 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:35,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1688260000, now seen corresponding path program 1 times [2019-11-23 21:04:35,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:35,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827521234] [2019-11-23 21:04:35,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 45 proven. 443 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 21:04:36,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827521234] [2019-11-23 21:04:36,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731250017] [2019-11-23 21:04:36,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:36,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 21:04:36,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,473 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2019-11-23 21:04:37,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:37,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:38,601 WARN L192 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-23 21:04:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 168 proven. 320 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 21:04:39,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:39,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-11-23 21:04:39,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878372387] [2019-11-23 21:04:39,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:04:39,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:04:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:04:39,199 INFO L87 Difference]: Start difference. First operand 3757 states and 4037 transitions. Second operand 13 states. [2019-11-23 21:04:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:59,566 INFO L93 Difference]: Finished difference Result 9352 states and 10064 transitions. [2019-11-23 21:04:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:04:59,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 419 [2019-11-23 21:04:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:59,588 INFO L225 Difference]: With dead ends: 9352 [2019-11-23 21:04:59,588 INFO L226 Difference]: Without dead ends: 5597 [2019-11-23 21:04:59,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:04:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-11-23 21:04:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 3757. [2019-11-23 21:04:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-11-23 21:04:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 4037 transitions. [2019-11-23 21:04:59,672 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 4037 transitions. Word has length 419 [2019-11-23 21:04:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:59,672 INFO L462 AbstractCegarLoop]: Abstraction has 3757 states and 4037 transitions. [2019-11-23 21:04:59,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:04:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 4037 transitions. [2019-11-23 21:04:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-11-23 21:04:59,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:59,688 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:59,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:59,892 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash 615073138, now seen corresponding path program 1 times [2019-11-23 21:04:59,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:59,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382299729] [2019-11-23 21:04:59,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 563 proven. 109 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 21:05:00,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382299729] [2019-11-23 21:05:00,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303436562] [2019-11-23 21:05:00,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:00,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:05:00,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:00,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:00,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-23 21:05:01,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:05:01,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-23 21:05:01,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869585723] [2019-11-23 21:05:01,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:05:01,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:01,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:05:01,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:05:01,295 INFO L87 Difference]: Start difference. First operand 3757 states and 4037 transitions. Second operand 4 states. [2019-11-23 21:05:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:02,743 INFO L93 Difference]: Finished difference Result 9458 states and 10172 transitions. [2019-11-23 21:05:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:05:02,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2019-11-23 21:05:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:02,767 INFO L225 Difference]: With dead ends: 9458 [2019-11-23 21:05:02,767 INFO L226 Difference]: Without dead ends: 5703 [2019-11-23 21:05:02,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:05:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-11-23 21:05:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 4174. [2019-11-23 21:05:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-11-23 21:05:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4485 transitions. [2019-11-23 21:05:02,840 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4485 transitions. Word has length 533 [2019-11-23 21:05:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:02,841 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 4485 transitions. [2019-11-23 21:05:02,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:05:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4485 transitions. [2019-11-23 21:05:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-11-23 21:05:02,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:02,852 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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] [2019-11-23 21:05:03,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:03,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1979476456, now seen corresponding path program 1 times [2019-11-23 21:05:03,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:03,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361865373] [2019-11-23 21:05:03,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 682 proven. 228 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-11-23 21:05:04,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361865373] [2019-11-23 21:05:04,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13547796] [2019-11-23 21:05:04,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:04,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:05:04,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-23 21:05:04,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:05:04,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-23 21:05:04,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372601225] [2019-11-23 21:05:04,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:05:04,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:04,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:05:04,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:05:04,705 INFO L87 Difference]: Start difference. First operand 4174 states and 4485 transitions. Second operand 3 states. [2019-11-23 21:05:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:05,261 INFO L93 Difference]: Finished difference Result 7510 states and 8069 transitions. [2019-11-23 21:05:05,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:05:05,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2019-11-23 21:05:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:05,262 INFO L225 Difference]: With dead ends: 7510 [2019-11-23 21:05:05,262 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:05:05,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 560 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:05:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:05:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:05:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:05:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:05:05,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 561 [2019-11-23 21:05:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:05,268 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:05:05,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:05:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:05:05,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:05:05,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:05,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:05:05,816 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 256 [2019-11-23 21:05:06,130 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 256 [2019-11-23 21:05:09,749 WARN L192 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 251 DAG size of output: 81 [2019-11-23 21:05:12,378 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 251 DAG size of output: 81 [2019-11-23 21:05:12,385 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-23 21:05:12,385 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:05:12,386 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,387 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:05:12,388 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-23 21:05:12,389 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:05:12,390 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:05:12,391 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:05:12,391 INFO L440 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse2 (= ~a10~0 1)) (.cse6 (= ~a19~0 9))) (let ((.cse7 (<= ~a10~0 2)) (.cse4 (not .cse6)) (.cse0 (<= ~a1~0 589891)) (.cse9 (<= 56 ~a1~0)) (.cse5 (= ~a19~0 8)) (.cse1 (= 14 ~a4~0)) (.cse3 (= ~a12~0 0)) (.cse8 (not .cse2))) (or (and (< 218 ~a1~0) .cse0 .cse1 .cse2 .cse3) (and (<= ~a1~0 218) (= ~a10~0 0) .cse4) (and (<= ~a19~0 8) (not .cse5)) (and .cse1 .cse6 .cse7 .cse3 .cse8) (and .cse1 .cse6 .cse7 .cse3 .cse9 (exists ((v_~a1~0_343 Int)) (and (<= v_~a1~0_343 218) (<= ~a1~0 (+ (div (* (div v_~a1~0_343 5) 5) 5) 505228)) (= 0 (mod v_~a1~0_343 5))))) (and .cse5 (not (= ~a10~0 4))) (and .cse0 .cse2 .cse4) (and .cse5 (exists ((v_~a1~0_346 Int)) (and (<= 0 (* 9 v_~a1~0_346)) (< 218 v_~a1~0_346) (<= v_~a1~0_346 589891) (<= (+ ~a1~0 545163) (div (* v_~a1~0_346 9) 10))))) (and .cse1 .cse6 .cse3 (<= (+ ~a1~0 13) 0)) (and (= ~a10~0 3) .cse0 .cse1 .cse6 .cse3) (and .cse9 .cse5) (and (<= ~a1~0 505232) .cse1 .cse6 .cse3 .cse8)))) [2019-11-23 21:05:12,391 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-23 21:05:12,391 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-23 21:05:12,391 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-23 21:05:12,391 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-23 21:05:12,392 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L447 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-23 21:05:12,393 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:05:12,394 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,395 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:05:12,396 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-23 21:05:12,397 INFO L440 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse2 (= ~a10~0 1)) (.cse6 (= ~a19~0 9))) (let ((.cse7 (<= ~a10~0 2)) (.cse4 (not .cse6)) (.cse0 (<= ~a1~0 589891)) (.cse9 (<= 56 ~a1~0)) (.cse5 (= ~a19~0 8)) (.cse1 (= 14 ~a4~0)) (.cse3 (= ~a12~0 0)) (.cse8 (not .cse2))) (or (and (< 218 ~a1~0) .cse0 .cse1 .cse2 .cse3) (and (<= ~a1~0 218) (= ~a10~0 0) .cse4) (and (<= ~a19~0 8) (not .cse5)) (and .cse1 .cse6 .cse7 .cse3 .cse8) (and .cse1 .cse6 .cse7 .cse3 .cse9 (exists ((v_~a1~0_343 Int)) (and (<= v_~a1~0_343 218) (<= ~a1~0 (+ (div (* (div v_~a1~0_343 5) 5) 5) 505228)) (= 0 (mod v_~a1~0_343 5))))) (and .cse5 (not (= ~a10~0 4))) (and .cse0 .cse2 .cse4) (and .cse5 (exists ((v_~a1~0_346 Int)) (and (<= 0 (* 9 v_~a1~0_346)) (< 218 v_~a1~0_346) (<= v_~a1~0_346 589891) (<= (+ ~a1~0 545163) (div (* v_~a1~0_346 9) 10))))) (and .cse1 .cse6 .cse3 (<= (+ ~a1~0 13) 0)) (and (= ~a10~0 3) .cse0 .cse1 .cse6 .cse3) (and .cse9 .cse5) (and (<= ~a1~0 505232) .cse1 .cse6 .cse3 .cse8)))) [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,398 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-23 21:05:12,399 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,400 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:05:12,401 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,402 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:05:12,403 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,404 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:05:12,405 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,406 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:05:12,407 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:05:12,408 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:05:12,408 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:05:12,408 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:05:12,408 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-23 21:05:12,408 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-23 21:05:12,408 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-23 21:05:12,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:05:12 BoogieIcfgContainer [2019-11-23 21:05:12,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:05:12,442 INFO L168 Benchmark]: Toolchain (without parser) took 59560.46 ms. Allocated memory was 145.2 MB in the beginning and 829.4 MB in the end (delta: 684.2 MB). Free memory was 100.2 MB in the beginning and 617.3 MB in the end (delta: -517.1 MB). Peak memory consumption was 656.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,443 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.54 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 100.0 MB in the beginning and 171.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.19 ms. Allocated memory is still 205.5 MB. Free memory was 171.5 MB in the beginning and 163.8 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,445 INFO L168 Benchmark]: Boogie Preprocessor took 158.61 ms. Allocated memory is still 205.5 MB. Free memory was 163.8 MB in the beginning and 158.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,446 INFO L168 Benchmark]: RCFGBuilder took 1395.51 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 158.3 MB in the beginning and 170.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,446 INFO L168 Benchmark]: TraceAbstraction took 57126.42 ms. Allocated memory was 238.0 MB in the beginning and 829.4 MB in the end (delta: 591.4 MB). Free memory was 169.0 MB in the beginning and 617.3 MB in the end (delta: -448.3 MB). Peak memory consumption was 632.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:12,450 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.54 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 100.0 MB in the beginning and 171.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.19 ms. Allocated memory is still 205.5 MB. Free memory was 171.5 MB in the beginning and 163.8 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.61 ms. Allocated memory is still 205.5 MB. Free memory was 163.8 MB in the beginning and 158.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1395.51 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 158.3 MB in the beginning and 170.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57126.42 ms. Allocated memory was 238.0 MB in the beginning and 829.4 MB in the end (delta: 591.4 MB). Free memory was 169.0 MB in the beginning and 617.3 MB in the end (delta: -448.3 MB). Peak memory consumption was 632.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 73]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2019-11-23 21:05:12,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] Derived loop invariant: ((((((((((((((218 < a1 && a1 <= 589891) && 14 == a4) && a10 == 1) && a12 == 0) || ((a1 <= 218 && a10 == 0) && !(a19 == 9))) || (a19 <= 8 && !(a19 == 8))) || ((((14 == a4 && a19 == 9) && a10 <= 2) && a12 == 0) && !(a10 == 1))) || (((((14 == a4 && a19 == 9) && a10 <= 2) && a12 == 0) && 56 <= a1) && (\exists v_~a1~0_343 : int :: (v_~a1~0_343 <= 218 && a1 <= v_~a1~0_343 / 5 * 5 / 5 + 505228) && 0 == v_~a1~0_343 % 5))) || (a19 == 8 && !(a10 == 4))) || ((a1 <= 589891 && a10 == 1) && !(a19 == 9))) || (a19 == 8 && (\exists v_~a1~0_346 : int :: ((0 <= 9 * v_~a1~0_346 && 218 < v_~a1~0_346) && v_~a1~0_346 <= 589891) && a1 + 545163 <= v_~a1~0_346 * 9 / 10))) || (((14 == a4 && a19 == 9) && a12 == 0) && a1 + 13 <= 0)) || ((((a10 == 3 && a1 <= 589891) && 14 == a4) && a19 == 9) && a12 == 0)) || (56 <= a1 && a19 == 8)) || ((((a1 <= 505232 && 14 == a4) && a19 == 9) && a12 == 0) && !(a10 == 1)) - InvariantResult [Line: 20]: Loop Invariant [2019-11-23 21:05:12,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-23 21:05:12,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-23 21:05:12,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] Derived loop invariant: ((((((((((((((218 < a1 && a1 <= 589891) && 14 == a4) && a10 == 1) && a12 == 0) || ((a1 <= 218 && a10 == 0) && !(a19 == 9))) || (a19 <= 8 && !(a19 == 8))) || ((((14 == a4 && a19 == 9) && a10 <= 2) && a12 == 0) && !(a10 == 1))) || (((((14 == a4 && a19 == 9) && a10 <= 2) && a12 == 0) && 56 <= a1) && (\exists v_~a1~0_343 : int :: (v_~a1~0_343 <= 218 && a1 <= v_~a1~0_343 / 5 * 5 / 5 + 505228) && 0 == v_~a1~0_343 % 5))) || (a19 == 8 && !(a10 == 4))) || ((a1 <= 589891 && a10 == 1) && !(a19 == 9))) || (a19 == 8 && (\exists v_~a1~0_346 : int :: ((0 <= 9 * v_~a1~0_346 && 218 < v_~a1~0_346) && v_~a1~0_346 <= 589891) && a1 + 545163 <= v_~a1~0_346 * 9 / 10))) || (((14 == a4 && a19 == 9) && a12 == 0) && a1 + 13 <= 0)) || ((((a10 == 3 && a1 <= 589891) && 14 == a4) && a19 == 9) && a12 == 0)) || (56 <= a1 && a19 == 8)) || ((((a1 <= 505232 && 14 == a4) && a19 == 9) && a12 == 0) && !(a10 == 1)) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 57.0s, OverallIterations: 13, TraceHistogramMax: 7, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, HoareTripleCheckerStatistics: 1019 SDtfs, 4453 SDslu, 207 SDs, 0 SdLazy, 12230 SolverSat, 1774 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 31.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2444 GetRequests, 2367 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4174occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 6707 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 86 NumberOfFragments, 381 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12036 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 47650 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 5944 NumberOfCodeBlocks, 5944 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5925 ConstructedInterpolants, 200 QuantifiedInterpolants, 11179190 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3162 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 5946/7489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...