java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:37:58,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:37:58,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:37:58,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:37:58,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:37:58,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:37:58,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:37:58,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:37:58,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:37:58,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:37:58,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:37:58,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:37:58,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:37:58,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:37:58,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:37:58,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:37:58,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:37:58,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:37:58,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:37:58,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:37:58,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:37:58,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:37:58,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:37:58,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:37:58,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:37:58,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:37:58,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:37:58,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:37:58,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:37:58,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:37:58,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:37:58,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:37:58,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:37:58,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:37:58,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:37:58,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:37:58,716 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 20:37:58,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:37:58,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:37:58,746 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:37:58,746 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:37:58,747 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:37:58,747 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:37:58,747 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:37:58,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:37:58,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:37:58,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:37:58,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:37:58,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:37:58,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:37:58,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:37:58,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:37:58,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:37:58,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:37:58,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:37:58,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:37:58,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:37:58,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:37:58,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:37:58,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:37:58,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:37:58,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:37:58,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:37:58,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:37:58,754 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:37:58,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:37:58,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:37:58,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:37:58,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:37:58,846 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:37:58,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label29_true-unreach-call.c [2018-10-23 20:37:58,915 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c9269d5ca/82f83a7181f045be921ca0f3b13dbcf4/FLAG5caf88cfc [2018-10-23 20:37:59,585 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:37:59,586 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label29_true-unreach-call.c [2018-10-23 20:37:59,617 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c9269d5ca/82f83a7181f045be921ca0f3b13dbcf4/FLAG5caf88cfc [2018-10-23 20:37:59,639 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c9269d5ca/82f83a7181f045be921ca0f3b13dbcf4 [2018-10-23 20:37:59,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:37:59,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:37:59,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:37:59,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:37:59,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:37:59,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:37:59" (1/1) ... [2018-10-23 20:37:59,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fbebad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:37:59, skipping insertion in model container [2018-10-23 20:37:59,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:37:59" (1/1) ... [2018-10-23 20:37:59,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:37:59,770 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:38:00,540 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:38:00,545 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:38:00,788 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:38:00,833 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:38:00,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00 WrapperNode [2018-10-23 20:38:00,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:38:00,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:38:00,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:38:00,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:38:00,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:00,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:38:01,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:38:01,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:38:01,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:38:01,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... [2018-10-23 20:38:01,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:38:01,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:38:01,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:38:01,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:38:01,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:38:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:38:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:38:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:38:07,721 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:38:07,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:38:07 BoogieIcfgContainer [2018-10-23 20:38:07,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:38:07,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:38:07,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:38:07,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:38:07,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:37:59" (1/3) ... [2018-10-23 20:38:07,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c657f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:38:07, skipping insertion in model container [2018-10-23 20:38:07,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:38:00" (2/3) ... [2018-10-23 20:38:07,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c657f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:38:07, skipping insertion in model container [2018-10-23 20:38:07,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:38:07" (3/3) ... [2018-10-23 20:38:07,730 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label29_true-unreach-call.c [2018-10-23 20:38:07,740 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:38:07,748 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:38:07,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:38:07,806 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:38:07,807 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:38:07,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:38:07,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:38:07,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:38:07,808 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:38:07,808 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:38:07,808 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:38:07,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:38:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states. [2018-10-23 20:38:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-23 20:38:07,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:07,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:07,851 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:07,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash 84973194, now seen corresponding path program 1 times [2018-10-23 20:38:07,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:07,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:07,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:38:08,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:08,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:38:08,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:38:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:38:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:08,362 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 4 states. [2018-10-23 20:38:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:14,342 INFO L93 Difference]: Finished difference Result 1458 states and 2766 transitions. [2018-10-23 20:38:14,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:38:14,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-10-23 20:38:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:14,391 INFO L225 Difference]: With dead ends: 1458 [2018-10-23 20:38:14,392 INFO L226 Difference]: Without dead ends: 1054 [2018-10-23 20:38:14,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-10-23 20:38:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2018-10-23 20:38:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-23 20:38:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1752 transitions. [2018-10-23 20:38:14,542 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1752 transitions. Word has length 47 [2018-10-23 20:38:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:14,543 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1752 transitions. [2018-10-23 20:38:14,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:38:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1752 transitions. [2018-10-23 20:38:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-23 20:38:14,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:14,550 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:38:14,550 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:14,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2039199834, now seen corresponding path program 1 times [2018-10-23 20:38:14,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:14,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:14,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:15,164 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-10-23 20:38:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:38:15,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:15,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:38:15,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:38:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:38:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:38:15,237 INFO L87 Difference]: Start difference. First operand 1054 states and 1752 transitions. Second operand 6 states. [2018-10-23 20:38:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:22,338 INFO L93 Difference]: Finished difference Result 3758 states and 6035 transitions. [2018-10-23 20:38:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:38:22,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-23 20:38:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:22,355 INFO L225 Difference]: With dead ends: 3758 [2018-10-23 20:38:22,356 INFO L226 Difference]: Without dead ends: 2706 [2018-10-23 20:38:22,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:38:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2018-10-23 20:38:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2018-10-23 20:38:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2018-10-23 20:38:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4033 transitions. [2018-10-23 20:38:22,430 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4033 transitions. Word has length 127 [2018-10-23 20:38:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:22,431 INFO L481 AbstractCegarLoop]: Abstraction has 2706 states and 4033 transitions. [2018-10-23 20:38:22,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:38:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4033 transitions. [2018-10-23 20:38:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-23 20:38:22,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:22,444 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:22,444 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -780115498, now seen corresponding path program 1 times [2018-10-23 20:38:22,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-23 20:38:22,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:22,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 20:38:22,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:38:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:38:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:38:22,756 INFO L87 Difference]: Start difference. First operand 2706 states and 4033 transitions. Second operand 3 states. [2018-10-23 20:38:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:26,676 INFO L93 Difference]: Finished difference Result 7058 states and 10936 transitions. [2018-10-23 20:38:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:38:26,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-10-23 20:38:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:26,702 INFO L225 Difference]: With dead ends: 7058 [2018-10-23 20:38:26,703 INFO L226 Difference]: Without dead ends: 4686 [2018-10-23 20:38:26,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:38:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2018-10-23 20:38:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4686. [2018-10-23 20:38:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2018-10-23 20:38:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6687 transitions. [2018-10-23 20:38:26,802 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6687 transitions. Word has length 215 [2018-10-23 20:38:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:26,803 INFO L481 AbstractCegarLoop]: Abstraction has 4686 states and 6687 transitions. [2018-10-23 20:38:26,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:38:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6687 transitions. [2018-10-23 20:38:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-23 20:38:26,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:26,808 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:38:26,808 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:26,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash 412784454, now seen corresponding path program 1 times [2018-10-23 20:38:26,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:26,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:26,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:26,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:26,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:38:27,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:27,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:38:27,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:38:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:38:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:27,190 INFO L87 Difference]: Start difference. First operand 4686 states and 6687 transitions. Second operand 4 states. [2018-10-23 20:38:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:30,174 INFO L93 Difference]: Finished difference Result 10688 states and 15064 transitions. [2018-10-23 20:38:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:38:30,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-10-23 20:38:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:30,199 INFO L225 Difference]: With dead ends: 10688 [2018-10-23 20:38:30,200 INFO L226 Difference]: Without dead ends: 4666 [2018-10-23 20:38:30,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2018-10-23 20:38:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2018-10-23 20:38:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2018-10-23 20:38:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 5238 transitions. [2018-10-23 20:38:30,285 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 5238 transitions. Word has length 232 [2018-10-23 20:38:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:30,285 INFO L481 AbstractCegarLoop]: Abstraction has 4666 states and 5238 transitions. [2018-10-23 20:38:30,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:38:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 5238 transitions. [2018-10-23 20:38:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-23 20:38:30,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:30,295 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:30,296 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:30,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash 674704788, now seen corresponding path program 1 times [2018-10-23 20:38:30,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:30,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:30,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:38:30,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:38:30,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:38:30,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:38:30,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:30,947 INFO L87 Difference]: Start difference. First operand 4666 states and 5238 transitions. Second operand 4 states. [2018-10-23 20:38:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:34,313 INFO L93 Difference]: Finished difference Result 9988 states and 11343 transitions. [2018-10-23 20:38:34,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:38:34,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-10-23 20:38:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:34,335 INFO L225 Difference]: With dead ends: 9988 [2018-10-23 20:38:34,335 INFO L226 Difference]: Without dead ends: 5986 [2018-10-23 20:38:34,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2018-10-23 20:38:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 5986. [2018-10-23 20:38:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2018-10-23 20:38:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 6494 transitions. [2018-10-23 20:38:34,428 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 6494 transitions. Word has length 380 [2018-10-23 20:38:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:34,429 INFO L481 AbstractCegarLoop]: Abstraction has 5986 states and 6494 transitions. [2018-10-23 20:38:34,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:38:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 6494 transitions. [2018-10-23 20:38:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-23 20:38:34,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:34,438 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:34,439 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:34,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1154717440, now seen corresponding path program 1 times [2018-10-23 20:38:34,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:34,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:34,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-23 20:38:35,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:38:35,060 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:38:35,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:35,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:38:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-23 20:38:35,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:38:35,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-23 20:38:35,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:38:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:38:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:38:35,675 INFO L87 Difference]: Start difference. First operand 5986 states and 6494 transitions. Second operand 8 states. [2018-10-23 20:38:36,779 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-23 20:38:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:40,970 INFO L93 Difference]: Finished difference Result 13947 states and 15117 transitions. [2018-10-23 20:38:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 20:38:40,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 388 [2018-10-23 20:38:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:41,006 INFO L225 Difference]: With dead ends: 13947 [2018-10-23 20:38:41,006 INFO L226 Difference]: Without dead ends: 9614 [2018-10-23 20:38:41,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:38:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9614 states. [2018-10-23 20:38:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9614 to 9614. [2018-10-23 20:38:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2018-10-23 20:38:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 10209 transitions. [2018-10-23 20:38:41,179 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 10209 transitions. Word has length 388 [2018-10-23 20:38:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:41,180 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 10209 transitions. [2018-10-23 20:38:41,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:38:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 10209 transitions. [2018-10-23 20:38:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-23 20:38:41,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:41,197 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:41,198 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:41,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 963790717, now seen corresponding path program 1 times [2018-10-23 20:38:41,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:41,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:41,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:41,577 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 20:38:41,900 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-23 20:38:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-10-23 20:38:42,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:42,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 20:38:42,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 20:38:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 20:38:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:38:42,387 INFO L87 Difference]: Start difference. First operand 9614 states and 10209 transitions. Second operand 7 states. [2018-10-23 20:38:44,285 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-23 20:38:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:46,806 INFO L93 Difference]: Finished difference Result 17344 states and 18462 transitions. [2018-10-23 20:38:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:38:46,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 502 [2018-10-23 20:38:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:46,835 INFO L225 Difference]: With dead ends: 17344 [2018-10-23 20:38:46,835 INFO L226 Difference]: Without dead ends: 9713 [2018-10-23 20:38:46,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:38:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9713 states. [2018-10-23 20:38:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9713 to 9614. [2018-10-23 20:38:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2018-10-23 20:38:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 10205 transitions. [2018-10-23 20:38:46,952 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 10205 transitions. Word has length 502 [2018-10-23 20:38:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:46,953 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 10205 transitions. [2018-10-23 20:38:46,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 20:38:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 10205 transitions. [2018-10-23 20:38:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-10-23 20:38:46,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:46,980 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:46,980 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:46,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1440214053, now seen corresponding path program 1 times [2018-10-23 20:38:46,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:46,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:46,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:46,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:47,552 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 20:38:47,923 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-23 20:38:48,356 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-10-23 20:38:48,696 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-10-23 20:38:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 825 proven. 130 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-23 20:38:50,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:38:50,024 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:38:50,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:50,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:38:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-10-23 20:38:50,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:38:50,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-10-23 20:38:50,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 20:38:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 20:38:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-23 20:38:50,757 INFO L87 Difference]: Start difference. First operand 9614 states and 10205 transitions. Second operand 11 states. [2018-10-23 20:38:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:38:57,565 INFO L93 Difference]: Finished difference Result 18587 states and 19729 transitions. [2018-10-23 20:38:57,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 20:38:57,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 711 [2018-10-23 20:38:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:38:57,583 INFO L225 Difference]: With dead ends: 18587 [2018-10-23 20:38:57,583 INFO L226 Difference]: Without dead ends: 9626 [2018-10-23 20:38:57,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2018-10-23 20:38:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2018-10-23 20:38:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 8944. [2018-10-23 20:38:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8944 states. [2018-10-23 20:38:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 9306 transitions. [2018-10-23 20:38:57,701 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 9306 transitions. Word has length 711 [2018-10-23 20:38:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:38:57,702 INFO L481 AbstractCegarLoop]: Abstraction has 8944 states and 9306 transitions. [2018-10-23 20:38:57,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 20:38:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 9306 transitions. [2018-10-23 20:38:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2018-10-23 20:38:57,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:38:57,719 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:38:57,719 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:38:57,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:38:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1444696310, now seen corresponding path program 1 times [2018-10-23 20:38:57,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:38:57,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:38:57,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:57,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:38:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:38:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:38:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1290 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-10-23 20:38:58,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:38:58,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:38:58,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:38:58,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:38:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:38:58,416 INFO L87 Difference]: Start difference. First operand 8944 states and 9306 transitions. Second operand 4 states. [2018-10-23 20:39:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:00,678 INFO L93 Difference]: Finished difference Result 16235 states and 16930 transitions. [2018-10-23 20:39:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:39:00,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 837 [2018-10-23 20:39:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:00,694 INFO L225 Difference]: With dead ends: 16235 [2018-10-23 20:39:00,695 INFO L226 Difference]: Without dead ends: 8610 [2018-10-23 20:39:00,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:39:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8610 states. [2018-10-23 20:39:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8610 to 8610. [2018-10-23 20:39:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8610 states. [2018-10-23 20:39:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8610 states to 8610 states and 8862 transitions. [2018-10-23 20:39:00,818 INFO L78 Accepts]: Start accepts. Automaton has 8610 states and 8862 transitions. Word has length 837 [2018-10-23 20:39:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:00,819 INFO L481 AbstractCegarLoop]: Abstraction has 8610 states and 8862 transitions. [2018-10-23 20:39:00,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:39:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 8610 states and 8862 transitions. [2018-10-23 20:39:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-10-23 20:39:00,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:00,844 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:39:00,844 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:00,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash -482303900, now seen corresponding path program 1 times [2018-10-23 20:39:00,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:00,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:00,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:00,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:00,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:01,836 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 20:39:02,101 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-23 20:39:02,432 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 20:39:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1131 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2018-10-23 20:39:04,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:39:04,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 20:39:04,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:39:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:39:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:39:04,465 INFO L87 Difference]: Start difference. First operand 8610 states and 8862 transitions. Second operand 6 states. [2018-10-23 20:39:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:08,136 INFO L93 Difference]: Finished difference Result 15571 states and 16055 transitions. [2018-10-23 20:39:08,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:39:08,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1067 [2018-10-23 20:39:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:08,153 INFO L225 Difference]: With dead ends: 15571 [2018-10-23 20:39:08,154 INFO L226 Difference]: Without dead ends: 9274 [2018-10-23 20:39:08,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:39:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9274 states. [2018-10-23 20:39:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9274 to 8940. [2018-10-23 20:39:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8940 states. [2018-10-23 20:39:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8940 states to 8940 states and 9198 transitions. [2018-10-23 20:39:08,264 INFO L78 Accepts]: Start accepts. Automaton has 8940 states and 9198 transitions. Word has length 1067 [2018-10-23 20:39:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:08,266 INFO L481 AbstractCegarLoop]: Abstraction has 8940 states and 9198 transitions. [2018-10-23 20:39:08,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:39:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8940 states and 9198 transitions. [2018-10-23 20:39:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-23 20:39:08,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:08,287 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:39:08,287 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:08,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash 667165986, now seen corresponding path program 1 times [2018-10-23 20:39:08,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:08,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:08,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:08,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:08,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2595 backedges. 1347 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2018-10-23 20:39:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:39:09,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:39:09,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:39:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:39:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:39:09,583 INFO L87 Difference]: Start difference. First operand 8940 states and 9198 transitions. Second operand 4 states. [2018-10-23 20:39:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:12,108 INFO L93 Difference]: Finished difference Result 23158 states and 23834 transitions. [2018-10-23 20:39:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:39:12,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1094 [2018-10-23 20:39:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:12,131 INFO L225 Difference]: With dead ends: 23158 [2018-10-23 20:39:12,131 INFO L226 Difference]: Without dead ends: 13557 [2018-10-23 20:39:12,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:39:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13557 states. [2018-10-23 20:39:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13557 to 13557. [2018-10-23 20:39:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13557 states. [2018-10-23 20:39:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13557 states to 13557 states and 13855 transitions. [2018-10-23 20:39:12,328 INFO L78 Accepts]: Start accepts. Automaton has 13557 states and 13855 transitions. Word has length 1094 [2018-10-23 20:39:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:12,330 INFO L481 AbstractCegarLoop]: Abstraction has 13557 states and 13855 transitions. [2018-10-23 20:39:12,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:39:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13557 states and 13855 transitions. [2018-10-23 20:39:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1206 [2018-10-23 20:39:12,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:12,365 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:39:12,365 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:12,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1589890281, now seen corresponding path program 1 times [2018-10-23 20:39:12,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:12,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:12,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:13,294 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 20:39:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1004 proven. 0 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2018-10-23 20:39:14,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:39:14,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:39:14,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:39:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:39:14,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:39:14,025 INFO L87 Difference]: Start difference. First operand 13557 states and 13855 transitions. Second operand 4 states. [2018-10-23 20:39:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:15,861 INFO L93 Difference]: Finished difference Result 24141 states and 24700 transitions. [2018-10-23 20:39:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:39:15,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1205 [2018-10-23 20:39:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:15,880 INFO L225 Difference]: With dead ends: 24141 [2018-10-23 20:39:15,880 INFO L226 Difference]: Without dead ends: 12557 [2018-10-23 20:39:15,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:39:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2018-10-23 20:39:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12557. [2018-10-23 20:39:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12557 states. [2018-10-23 20:39:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12557 states to 12557 states and 12772 transitions. [2018-10-23 20:39:16,018 INFO L78 Accepts]: Start accepts. Automaton has 12557 states and 12772 transitions. Word has length 1205 [2018-10-23 20:39:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:16,019 INFO L481 AbstractCegarLoop]: Abstraction has 12557 states and 12772 transitions. [2018-10-23 20:39:16,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:39:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 12557 states and 12772 transitions. [2018-10-23 20:39:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1286 [2018-10-23 20:39:16,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:16,043 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:39:16,044 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:16,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1009892641, now seen corresponding path program 1 times [2018-10-23 20:39:16,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:16,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:16,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 1989 proven. 310 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-10-23 20:39:18,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:39:18,719 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:39:18,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:19,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:39:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2271 proven. 28 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-10-23 20:39:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:39:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2018-10-23 20:39:20,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 20:39:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 20:39:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:39:20,567 INFO L87 Difference]: Start difference. First operand 12557 states and 12772 transitions. Second operand 7 states. [2018-10-23 20:39:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:24,060 INFO L93 Difference]: Finished difference Result 22141 states and 22534 transitions. [2018-10-23 20:39:24,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:39:24,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1285 [2018-10-23 20:39:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:24,076 INFO L225 Difference]: With dead ends: 22141 [2018-10-23 20:39:24,076 INFO L226 Difference]: Without dead ends: 12557 [2018-10-23 20:39:24,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1293 GetRequests, 1286 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:39:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2018-10-23 20:39:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12227. [2018-10-23 20:39:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12227 states. [2018-10-23 20:39:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12227 states to 12227 states and 12422 transitions. [2018-10-23 20:39:24,209 INFO L78 Accepts]: Start accepts. Automaton has 12227 states and 12422 transitions. Word has length 1285 [2018-10-23 20:39:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:24,210 INFO L481 AbstractCegarLoop]: Abstraction has 12227 states and 12422 transitions. [2018-10-23 20:39:24,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 20:39:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 12227 states and 12422 transitions. [2018-10-23 20:39:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1792 [2018-10-23 20:39:24,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:24,247 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2018-10-23 20:39:24,248 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:24,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:24,248 INFO L82 PathProgramCache]: Analyzing trace with hash 262554205, now seen corresponding path program 1 times [2018-10-23 20:39:24,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:24,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:24,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:24,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:24,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 4482 proven. 151 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2018-10-23 20:39:29,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:39:29,027 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:39:29,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:29,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:39:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 3297 proven. 0 refuted. 0 times theorem prover too weak. 2317 trivial. 0 not checked. [2018-10-23 20:39:32,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:39:32,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-10-23 20:39:32,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 20:39:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 20:39:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-23 20:39:32,046 INFO L87 Difference]: Start difference. First operand 12227 states and 12422 transitions. Second operand 11 states. [2018-10-23 20:39:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:38,638 INFO L93 Difference]: Finished difference Result 22258 states and 22642 transitions. [2018-10-23 20:39:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-23 20:39:38,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1791 [2018-10-23 20:39:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:38,651 INFO L225 Difference]: With dead ends: 22258 [2018-10-23 20:39:38,651 INFO L226 Difference]: Without dead ends: 13004 [2018-10-23 20:39:38,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1816 GetRequests, 1798 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2018-10-23 20:39:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13004 states. [2018-10-23 20:39:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13004 to 12887. [2018-10-23 20:39:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12887 states. [2018-10-23 20:39:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12887 states to 12887 states and 13093 transitions. [2018-10-23 20:39:38,781 INFO L78 Accepts]: Start accepts. Automaton has 12887 states and 13093 transitions. Word has length 1791 [2018-10-23 20:39:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:38,782 INFO L481 AbstractCegarLoop]: Abstraction has 12887 states and 13093 transitions. [2018-10-23 20:39:38,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 20:39:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12887 states and 13093 transitions. [2018-10-23 20:39:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1954 [2018-10-23 20:39:38,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:38,815 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2018-10-23 20:39:38,815 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:38,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1643629548, now seen corresponding path program 1 times [2018-10-23 20:39:38,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:38,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 2799 proven. 243 refuted. 0 times theorem prover too weak. 3835 trivial. 0 not checked. [2018-10-23 20:39:45,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:39:45,002 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:39:45,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:45,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:39:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 2799 proven. 0 refuted. 0 times theorem prover too weak. 4078 trivial. 0 not checked. [2018-10-23 20:39:48,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:39:48,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-10-23 20:39:48,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 20:39:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 20:39:48,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:39:48,297 INFO L87 Difference]: Start difference. First operand 12887 states and 13093 transitions. Second operand 10 states. [2018-10-23 20:39:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:39:55,926 INFO L93 Difference]: Finished difference Result 24125 states and 24536 transitions. [2018-10-23 20:39:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 20:39:55,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1953 [2018-10-23 20:39:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:39:55,938 INFO L225 Difference]: With dead ends: 24125 [2018-10-23 20:39:55,939 INFO L226 Difference]: Without dead ends: 13218 [2018-10-23 20:39:55,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1968 GetRequests, 1952 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-23 20:39:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13218 states. [2018-10-23 20:39:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13218 to 12223. [2018-10-23 20:39:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12223 states. [2018-10-23 20:39:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12223 states to 12223 states and 12427 transitions. [2018-10-23 20:39:56,069 INFO L78 Accepts]: Start accepts. Automaton has 12223 states and 12427 transitions. Word has length 1953 [2018-10-23 20:39:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:39:56,069 INFO L481 AbstractCegarLoop]: Abstraction has 12223 states and 12427 transitions. [2018-10-23 20:39:56,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 20:39:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12223 states and 12427 transitions. [2018-10-23 20:39:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1985 [2018-10-23 20:39:56,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:39:56,098 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:39:56,099 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:39:56,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:39:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 597701559, now seen corresponding path program 1 times [2018-10-23 20:39:56,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:39:56,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:39:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:39:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:39:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:39:56,949 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-23 20:39:57,187 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-10-23 20:40:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7621 backedges. 2706 proven. 158 refuted. 0 times theorem prover too weak. 4757 trivial. 0 not checked. [2018-10-23 20:40:00,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:40:00,306 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:40:00,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:00,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:40:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7621 backedges. 2864 proven. 0 refuted. 0 times theorem prover too weak. 4757 trivial. 0 not checked. [2018-10-23 20:40:03,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:40:03,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-23 20:40:03,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 20:40:03,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 20:40:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:40:03,121 INFO L87 Difference]: Start difference. First operand 12223 states and 12427 transitions. Second operand 10 states. [2018-10-23 20:40:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:40:10,877 INFO L93 Difference]: Finished difference Result 30175 states and 30736 transitions. [2018-10-23 20:40:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-23 20:40:10,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1984 [2018-10-23 20:40:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:40:10,892 INFO L225 Difference]: With dead ends: 30175 [2018-10-23 20:40:10,892 INFO L226 Difference]: Without dead ends: 18966 [2018-10-23 20:40:10,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2012 GetRequests, 1993 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-10-23 20:40:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18966 states. [2018-10-23 20:40:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18966 to 16183. [2018-10-23 20:40:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16183 states. [2018-10-23 20:40:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16183 states to 16183 states and 16438 transitions. [2018-10-23 20:40:11,051 INFO L78 Accepts]: Start accepts. Automaton has 16183 states and 16438 transitions. Word has length 1984 [2018-10-23 20:40:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:40:11,052 INFO L481 AbstractCegarLoop]: Abstraction has 16183 states and 16438 transitions. [2018-10-23 20:40:11,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 20:40:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 16183 states and 16438 transitions. [2018-10-23 20:40:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2048 [2018-10-23 20:40:11,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:40:11,082 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-23 20:40:11,083 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:40:11,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:40:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash 86088019, now seen corresponding path program 1 times [2018-10-23 20:40:11,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:40:11,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:40:11,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:40:11,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:11,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:40:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:12,744 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 20:40:13,181 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-23 20:40:13,428 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-10-23 20:40:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7932 backedges. 4278 proven. 1877 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-10-23 20:40:17,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:40:17,038 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:40:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:17,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:40:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7932 backedges. 4413 proven. 0 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2018-10-23 20:40:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:40:19,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-10-23 20:40:19,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 20:40:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 20:40:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-23 20:40:19,799 INFO L87 Difference]: Start difference. First operand 16183 states and 16438 transitions. Second operand 11 states. [2018-10-23 20:40:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:40:28,202 INFO L93 Difference]: Finished difference Result 32694 states and 33223 transitions. [2018-10-23 20:40:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 20:40:28,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2047 [2018-10-23 20:40:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:40:28,218 INFO L225 Difference]: With dead ends: 32694 [2018-10-23 20:40:28,218 INFO L226 Difference]: Without dead ends: 17833 [2018-10-23 20:40:28,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2061 GetRequests, 2049 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-23 20:40:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2018-10-23 20:40:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 17173. [2018-10-23 20:40:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17173 states. [2018-10-23 20:40:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17173 states to 17173 states and 17436 transitions. [2018-10-23 20:40:28,396 INFO L78 Accepts]: Start accepts. Automaton has 17173 states and 17436 transitions. Word has length 2047 [2018-10-23 20:40:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:40:28,397 INFO L481 AbstractCegarLoop]: Abstraction has 17173 states and 17436 transitions. [2018-10-23 20:40:28,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 20:40:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 17173 states and 17436 transitions. [2018-10-23 20:40:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2261 [2018-10-23 20:40:28,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:40:28,440 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:40:28,441 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:40:28,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:40:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1498146993, now seen corresponding path program 1 times [2018-10-23 20:40:28,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:40:28,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:40:28,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:40:28,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:28,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:40:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:29,818 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 20:40:29,998 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 20:40:30,275 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-23 20:40:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9172 backedges. 4005 proven. 251 refuted. 0 times theorem prover too weak. 4916 trivial. 0 not checked. [2018-10-23 20:40:35,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:40:35,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:40:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:36,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:40:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9172 backedges. 5036 proven. 0 refuted. 0 times theorem prover too weak. 4136 trivial. 0 not checked. [2018-10-23 20:40:40,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:40:40,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-23 20:40:40,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 20:40:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 20:40:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:40:40,189 INFO L87 Difference]: Start difference. First operand 17173 states and 17436 transitions. Second operand 10 states. [2018-10-23 20:40:44,541 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-10-23 20:40:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:40:51,636 INFO L93 Difference]: Finished difference Result 38480 states and 39121 transitions. [2018-10-23 20:40:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-23 20:40:51,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2260 [2018-10-23 20:40:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:40:51,655 INFO L225 Difference]: With dead ends: 38480 [2018-10-23 20:40:51,655 INFO L226 Difference]: Without dead ends: 22469 [2018-10-23 20:40:51,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2283 GetRequests, 2265 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-23 20:40:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22469 states. [2018-10-23 20:40:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22469 to 19829. [2018-10-23 20:40:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19829 states. [2018-10-23 20:40:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 20095 transitions. [2018-10-23 20:40:51,882 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 20095 transitions. Word has length 2260 [2018-10-23 20:40:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:40:51,882 INFO L481 AbstractCegarLoop]: Abstraction has 19829 states and 20095 transitions. [2018-10-23 20:40:51,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 20:40:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 20095 transitions. [2018-10-23 20:40:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2018-10-23 20:40:51,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:40:51,935 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:40:51,935 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:40:51,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:40:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -178663838, now seen corresponding path program 1 times [2018-10-23 20:40:51,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:40:51,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:40:51,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:40:51,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:51,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:40:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 2578 proven. 45 refuted. 0 times theorem prover too weak. 9727 trivial. 0 not checked. [2018-10-23 20:40:56,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:40:56,182 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:40:56,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:40:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:40:56,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:40:57,019 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2018-10-23 20:41:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 2578 proven. 45 refuted. 0 times theorem prover too weak. 9727 trivial. 0 not checked. [2018-10-23 20:41:00,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:41:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-10-23 20:41:00,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:41:00,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:41:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:41:00,858 INFO L87 Difference]: Start difference. First operand 19829 states and 20095 transitions. Second operand 6 states. [2018-10-23 20:41:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:41:09,504 INFO L93 Difference]: Finished difference Result 38333 states and 38860 transitions. [2018-10-23 20:41:09,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:41:09,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2599 [2018-10-23 20:41:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:41:09,505 INFO L225 Difference]: With dead ends: 38333 [2018-10-23 20:41:09,506 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 20:41:09,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2603 GetRequests, 2599 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:41:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 20:41:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 20:41:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 20:41:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 20:41:09,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2599 [2018-10-23 20:41:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:41:09,519 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 20:41:09,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:41:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 20:41:09,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 20:41:09,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 20:41:09,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:09,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,477 WARN L179 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 370 [2018-10-23 20:41:10,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,695 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 201 [2018-10-23 20:41:10,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:10,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:41:11,413 WARN L179 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 545 DAG size of output: 371 [2018-10-23 20:41:15,195 WARN L179 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 322 DAG size of output: 113 [2018-10-23 20:41:17,035 WARN L179 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 194 DAG size of output: 118 [2018-10-23 20:41:20,215 WARN L179 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 322 DAG size of output: 113 [2018-10-23 20:41:20,219 INFO L425 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,219 INFO L425 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,219 INFO L425 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,219 INFO L425 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,219 INFO L425 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,219 INFO L425 ceAbstractionStarter]: For program point L168(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L102(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L36(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-23 20:41:20,220 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L421 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse10 (= ~a16~0 9))) (let ((.cse21 (= ~a12~0 7)) (.cse12 (<= ~a18~0 134)) (.cse22 (+ ~a18~0 156)) (.cse8 (= ~a15~0 4)) (.cse2 (<= ~a16~0 11)) (.cse3 (not (= ~a16~0 11))) (.cse5 (not .cse10)) (.cse20 (= ~a12~0 5))) (let ((.cse0 (and .cse8 .cse2 .cse3 .cse5 .cse20)) (.cse16 (<= ~a16~0 9)) (.cse1 (<= (+ ~a18~0 79) 0)) (.cse14 (< 0 .cse22)) (.cse17 (or .cse12 (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse20))) (.cse13 (<= 11 ~a16~0)) (.cse7 (exists ((v_prenex_3 Int)) (let ((.cse23 (* 5 (div (* 10 v_prenex_3) (- 5))))) (and (<= 0 .cse23) (<= (+ v_prenex_3 79) 0) (<= 5 .cse23) (<= (div .cse23 5) ~a18~0))))) (.cse19 (= ~a12~0 6)) (.cse9 (= ~a16~0 8)) (.cse6 (not (= 5 ~a12~0))) (.cse11 (not .cse21)) (.cse18 (<= .cse22 0)) (.cse4 (= ~a15~0 3))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0) (or (and .cse7 (= ~a12~0 9) (and .cse8 .cse9)) (and .cse8 .cse10 (<= (+ ~a18~0 391209) 0))) (and .cse10 .cse4 .cse11) (and .cse12 (and .cse13 .cse4) .cse14) (and (exists ((v_~a18~0_904 Int)) (let ((.cse15 (mod v_~a18~0_904 299932))) (and (<= (+ .cse15 136) ~a18~0) (not (= 0 .cse15)) (<= (+ v_~a18~0_904 156) 0) (< v_~a18~0_904 0)))) .cse4 .cse16 .cse6) (and .cse12 (and .cse4 .cse6) (not (= 7 ~a12~0))) (and .cse8 .cse9 (= ~a12~0 8) .cse17) (and (and .cse8 .cse18 .cse16) .cse19) (and .cse9 .cse4) (and .cse8 .cse20 .cse1 .cse2 .cse3 .cse14) (and (and .cse8 .cse2 .cse3 (not .cse9) .cse5) .cse19) (and .cse8 .cse9 .cse17 .cse14) (and .cse12 (and .cse8 .cse10 .cse6)) (and .cse8 .cse9 .cse21 .cse17) (and .cse13 .cse3 .cse4 .cse7 .cse20) (and .cse8 .cse10 .cse21) (and .cse8 .cse9 .cse7 .cse19) (and .cse8 .cse9 .cse20) (and .cse2 .cse12 .cse4 .cse20) (and (<= 136 ~a18~0) (and .cse3 .cse4 .cse6 .cse11)) (and .cse2 .cse18 .cse3 .cse4))))) [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L171(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L105(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L39(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,221 INFO L425 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L174(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L108(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,222 INFO L425 ceAbstractionStarter]: For program point L42(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,223 INFO L425 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L177(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L111(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L45(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-23 20:41:20,224 INFO L425 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L421 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse19 (+ ~a18~0 156)) (.cse3 (= ~a16~0 9)) (.cse0 (= ~a16~0 8)) (.cse21 (= ~a12~0 7))) (let ((.cse14 (<= 11 ~a16~0)) (.cse15 (not .cse21)) (.cse16 (<= ~a16~0 9)) (.cse17 (= ~a12~0 6)) (.cse6 (= ~a15~0 3)) (.cse12 (not (= 7 ~a12~0))) (.cse20 (not .cse0)) (.cse2 (exists ((v_prenex_3 Int)) (let ((.cse22 (* 5 (div (* 10 v_prenex_3) (- 5))))) (and (<= 0 .cse22) (<= (+ v_prenex_3 79) 0) (<= 5 .cse22) (<= (div .cse22 5) ~a18~0))))) (.cse7 (not .cse3)) (.cse8 (not (= 5 ~a12~0))) (.cse4 (<= ~a16~0 11)) (.cse5 (not (= ~a16~0 11))) (.cse9 (= ~a12~0 5)) (.cse10 (<= (+ ~a18~0 79) 0)) (.cse11 (< 0 .cse19)) (.cse13 (<= ~a18~0 134)) (.cse1 (= ~a15~0 4))) (or (or (and .cse0 .cse1 .cse2 (= ~a12~0 9)) (and .cse1 .cse3 (<= (+ ~a18~0 391209) 0))) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 .cse6 .cse9) (and (and (and .cse6 .cse10) .cse11) .cse12) (and .cse6 .cse13 .cse8 .cse12) (and .cse14 .cse5 .cse6 .cse2 .cse9) (and .cse4 .cse5 .cse6 .cse8 .cse15) (and .cse1 .cse7 .cse2 .cse16 .cse17) (and .cse14 .cse6 .cse13 .cse8 .cse11) (and .cse5 .cse6 .cse8 (<= 136 ~a18~0) .cse15) (and .cse4 .cse6 .cse13 .cse9) (and .cse0 .cse6) (and (exists ((v_~a18~0_904 Int)) (let ((.cse18 (mod v_~a18~0_904 299932))) (and (<= (+ .cse18 136) ~a18~0) (not (= 0 .cse18)) (<= (+ v_~a18~0_904 156) 0) (< v_~a18~0_904 0)))) .cse6 .cse16 .cse8) (and .cse0 .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse4 (<= .cse19 0) .cse5 .cse6) (and .cse1 .cse13 .cse16 .cse17) (and .cse1 .cse4 .cse5 .cse20 .cse7 .cse17) (and .cse0 .cse1 .cse13 (= ~a12~0 8)) (and .cse6 .cse13 .cse12 (or (not (= ~a16~0 12)) (not (= 4 ULTIMATE.start_calculate_output_~input))) .cse11) (and .cse0 .cse1 .cse13 .cse11) (and (and .cse1 .cse4 .cse5 .cse20 .cse7 .cse9) .cse2) (and .cse1 .cse7 .cse9 .cse4 (<= (+ ~a18~0 87) 0) .cse5) (and .cse1 .cse3 .cse13 .cse8) (and .cse1 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse21 .cse13) (and .cse1 .cse3 .cse21)))) [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L180(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L114(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L48(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,225 INFO L425 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L428 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L183(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L117(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L51(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,226 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,227 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L186(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L120(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L54(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-23 20:41:20,228 INFO L425 ceAbstractionStarter]: For program point L1773-1(lines 1773 1782) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L421 ceAbstractionStarter]: At program point L1773-3(lines 1773 1782) the Hoare annotation is: (let ((.cse10 (= ~a16~0 9))) (let ((.cse21 (= ~a12~0 7)) (.cse12 (<= ~a18~0 134)) (.cse22 (+ ~a18~0 156)) (.cse8 (= ~a15~0 4)) (.cse2 (<= ~a16~0 11)) (.cse3 (not (= ~a16~0 11))) (.cse5 (not .cse10)) (.cse20 (= ~a12~0 5))) (let ((.cse0 (and .cse8 .cse2 .cse3 .cse5 .cse20)) (.cse16 (<= ~a16~0 9)) (.cse1 (<= (+ ~a18~0 79) 0)) (.cse14 (< 0 .cse22)) (.cse17 (or .cse12 (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse20))) (.cse13 (<= 11 ~a16~0)) (.cse7 (exists ((v_prenex_3 Int)) (let ((.cse23 (* 5 (div (* 10 v_prenex_3) (- 5))))) (and (<= 0 .cse23) (<= (+ v_prenex_3 79) 0) (<= 5 .cse23) (<= (div .cse23 5) ~a18~0))))) (.cse19 (= ~a12~0 6)) (.cse9 (= ~a16~0 8)) (.cse6 (not (= 5 ~a12~0))) (.cse11 (not .cse21)) (.cse18 (<= .cse22 0)) (.cse4 (= ~a15~0 3))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0) (or (and .cse7 (= ~a12~0 9) (and .cse8 .cse9)) (and .cse8 .cse10 (<= (+ ~a18~0 391209) 0))) (and .cse10 .cse4 .cse11) (and .cse12 (and .cse13 .cse4) .cse14) (and (exists ((v_~a18~0_904 Int)) (let ((.cse15 (mod v_~a18~0_904 299932))) (and (<= (+ .cse15 136) ~a18~0) (not (= 0 .cse15)) (<= (+ v_~a18~0_904 156) 0) (< v_~a18~0_904 0)))) .cse4 .cse16 .cse6) (and .cse12 (and .cse4 .cse6) (not (= 7 ~a12~0))) (and .cse8 .cse9 (= ~a12~0 8) .cse17) (and (and .cse8 .cse18 .cse16) .cse19) (and .cse9 .cse4) (and .cse8 .cse20 .cse1 .cse2 .cse3 .cse14) (and (and .cse8 .cse2 .cse3 (not .cse9) .cse5) .cse19) (and .cse8 .cse9 .cse17 .cse14) (and .cse12 (and .cse8 .cse10 .cse6)) (and .cse8 .cse9 .cse21 .cse17) (and .cse13 .cse3 .cse4 .cse7 .cse20) (and .cse8 .cse10 .cse21) (and .cse8 .cse9 .cse7 .cse19) (and .cse8 .cse9 .cse20) (and .cse2 .cse12 .cse4 .cse20) (and (<= 136 ~a18~0) (and .cse3 .cse4 .cse6 .cse11)) (and .cse2 .cse18 .cse3 .cse4))))) [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L189(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L123(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L57(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,229 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,230 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L192(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L126(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L60(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-23 20:41:20,231 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L195(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L129(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L63(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,232 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L198(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L132(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L66(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,233 INFO L425 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L201(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L135(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L69(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,234 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,235 INFO L425 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L204(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L138(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L72(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,236 INFO L425 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,237 INFO L425 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L141(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L75(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,238 INFO L425 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,239 INFO L425 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L78(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,240 INFO L425 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L147(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L81(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,241 INFO L425 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,242 INFO L425 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L150(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L84(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,243 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L153(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,244 INFO L425 ceAbstractionStarter]: For program point L87(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,245 INFO L425 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L156(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L90(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,246 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,247 INFO L425 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L159(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L93(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L27(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-23 20:41:20,248 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L162(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L96(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,249 INFO L425 ceAbstractionStarter]: For program point L30(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-23 20:41:20,250 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L165(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L99(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L33(lines 23 1492) no Hoare annotation was computed. [2018-10-23 20:41:20,251 INFO L425 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,252 INFO L425 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-10-23 20:41:20,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,265 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,265 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,265 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,266 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,266 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,319 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,319 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,319 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,324 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,324 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,329 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,329 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,329 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,329 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:41:20 BoogieIcfgContainer [2018-10-23 20:41:20,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:41:20,333 INFO L168 Benchmark]: Toolchain (without parser) took 200680.36 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-23 20:41:20,335 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:41:20,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1183.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 20:41:20,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 333.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -856.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-23 20:41:20,337 INFO L168 Benchmark]: Boogie Preprocessor took 196.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:41:20,337 INFO L168 Benchmark]: RCFGBuilder took 6351.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 256.1 MB). Peak memory consumption was 256.1 MB. Max. memory is 7.1 GB. [2018-10-23 20:41:20,338 INFO L168 Benchmark]: TraceAbstraction took 192609.75 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.8 GB in the end (delta: -881.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-23 20:41:20,346 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1183.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 333.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -856.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6351.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 256.1 MB). Peak memory consumption was 256.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192609.75 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.8 GB in the end (delta: -881.5 MB). Peak memory consumption was 2.3 GB. 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_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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: 23]: Loop Invariant [2018-10-23 20:41:20,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,376 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,376 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,376 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,377 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,377 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,377 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,378 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 9)) && a12 == 5) && a18 + 79 <= 0) || ((((a16 <= 11 && !(a16 == 11)) && a15 == 3) && !(a16 == 9)) && !(5 == a12))) || ((\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18) && (((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 9)) && a12 == 5)) || (((\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18) && a12 == 9) && a15 == 4 && a16 == 8) || ((a15 == 4 && a16 == 9) && a18 + 391209 <= 0)) || ((a16 == 9 && a15 == 3) && !(a12 == 7))) || ((a18 <= 134 && 11 <= a16 && a15 == 3) && 0 < a18 + 156)) || ((((\exists v_~a18~0_904 : int :: ((v_~a18~0_904 % 299932 + 136 <= a18 && !(0 == v_~a18~0_904 % 299932)) && v_~a18~0_904 + 156 <= 0) && v_~a18~0_904 < 0) && a15 == 3) && a16 <= 9) && !(5 == a12))) || ((a18 <= 134 && a15 == 3 && !(5 == a12)) && !(7 == a12))) || (((a15 == 4 && a16 == 8) && a12 == 8) && (a18 <= 134 || (!(3 == input) && a12 == 5)))) || (((a15 == 4 && a18 + 156 <= 0) && a16 <= 9) && a12 == 6)) || (a16 == 8 && a15 == 3)) || (((((a15 == 4 && a12 == 5) && a18 + 79 <= 0) && a16 <= 11) && !(a16 == 11)) && 0 < a18 + 156)) || (((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 8)) && !(a16 == 9)) && a12 == 6)) || (((a15 == 4 && a16 == 8) && (a18 <= 134 || (!(3 == input) && a12 == 5))) && 0 < a18 + 156)) || (a18 <= 134 && (a15 == 4 && a16 == 9) && !(5 == a12))) || (((a15 == 4 && a16 == 8) && a12 == 7) && (a18 <= 134 || (!(3 == input) && a12 == 5)))) || ((((11 <= a16 && !(a16 == 11)) && a15 == 3) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a12 == 5)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((a15 == 4 && a16 == 8) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a12 == 6)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || (((a16 <= 11 && a18 <= 134) && a15 == 3) && a12 == 5)) || (136 <= a18 && ((!(a16 == 11) && a15 == 3) && !(5 == a12)) && !(a12 == 7))) || (((a16 <= 11 && a18 + 156 <= 0) && !(a16 == 11)) && a15 == 3) - InvariantResult [Line: 1494]: Loop Invariant [2018-10-23 20:41:20,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,399 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,399 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,399 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a16 == 8 && a15 == 4) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a12 == 9) || ((a15 == 4 && a16 == 9) && a18 + 391209 <= 0)) || ((((a16 <= 11 && !(a16 == 11)) && a15 == 3) && !(a16 == 9)) && !(5 == a12))) || ((a16 == 9 && a15 == 3) && a12 == 5)) || (((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156) && !(7 == a12))) || (((a15 == 3 && a18 <= 134) && !(5 == a12)) && !(7 == a12))) || ((((11 <= a16 && !(a16 == 11)) && a15 == 3) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a12 == 5)) || ((((a16 <= 11 && !(a16 == 11)) && a15 == 3) && !(5 == a12)) && !(a12 == 7))) || ((((a15 == 4 && !(a16 == 9)) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a16 <= 9) && a12 == 6)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && !(5 == a12)) && 0 < a18 + 156)) || ((((!(a16 == 11) && a15 == 3) && !(5 == a12)) && 136 <= a18) && !(a12 == 7))) || (((a16 <= 11 && a15 == 3) && a18 <= 134) && a12 == 5)) || (a16 == 8 && a15 == 3)) || ((((\exists v_~a18~0_904 : int :: ((v_~a18~0_904 % 299932 + 136 <= a18 && !(0 == v_~a18~0_904 % 299932)) && v_~a18~0_904 + 156 <= 0) && v_~a18~0_904 < 0) && a15 == 3) && a16 <= 9) && !(5 == a12))) || (((a16 == 8 && a15 == 4) && !(3 == input)) && a12 == 5)) || (((a16 <= 11 && a18 + 156 <= 0) && !(a16 == 11)) && a15 == 3)) || (((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 6)) || (((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 8)) && !(a16 == 9)) && a12 == 6)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || ((((a15 == 3 && a18 <= 134) && !(7 == a12)) && (!(a16 == 12) || !(4 == input))) && 0 < a18 + 156)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && 0 < a18 + 156)) || ((((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 8)) && !(a16 == 9)) && a12 == 5) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18))) || (((((a15 == 4 && !(a16 == 9)) && a12 == 5) && a16 <= 11) && a18 + 87 <= 0) && !(a16 == 11))) || (((a15 == 4 && a16 == 9) && a18 <= 134) && !(5 == a12))) || (((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)) || (((a16 == 8 && a15 == 4) && a12 == 7) && a18 <= 134)) || ((a15 == 4 && a16 == 9) && a12 == 7) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2018-10-23 20:41:20,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,412 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,412 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,413 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,413 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,413 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,413 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,414 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,414 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,414 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-10-23 20:41:20,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,416 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-10-23 20:41:20,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 9)) && a12 == 5) && a18 + 79 <= 0) || ((((a16 <= 11 && !(a16 == 11)) && a15 == 3) && !(a16 == 9)) && !(5 == a12))) || ((\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18) && (((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 9)) && a12 == 5)) || (((\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18) && a12 == 9) && a15 == 4 && a16 == 8) || ((a15 == 4 && a16 == 9) && a18 + 391209 <= 0)) || ((a16 == 9 && a15 == 3) && !(a12 == 7))) || ((a18 <= 134 && 11 <= a16 && a15 == 3) && 0 < a18 + 156)) || ((((\exists v_~a18~0_904 : int :: ((v_~a18~0_904 % 299932 + 136 <= a18 && !(0 == v_~a18~0_904 % 299932)) && v_~a18~0_904 + 156 <= 0) && v_~a18~0_904 < 0) && a15 == 3) && a16 <= 9) && !(5 == a12))) || ((a18 <= 134 && a15 == 3 && !(5 == a12)) && !(7 == a12))) || (((a15 == 4 && a16 == 8) && a12 == 8) && (a18 <= 134 || (!(3 == input) && a12 == 5)))) || (((a15 == 4 && a18 + 156 <= 0) && a16 <= 9) && a12 == 6)) || (a16 == 8 && a15 == 3)) || (((((a15 == 4 && a12 == 5) && a18 + 79 <= 0) && a16 <= 11) && !(a16 == 11)) && 0 < a18 + 156)) || (((((a15 == 4 && a16 <= 11) && !(a16 == 11)) && !(a16 == 8)) && !(a16 == 9)) && a12 == 6)) || (((a15 == 4 && a16 == 8) && (a18 <= 134 || (!(3 == input) && a12 == 5))) && 0 < a18 + 156)) || (a18 <= 134 && (a15 == 4 && a16 == 9) && !(5 == a12))) || (((a15 == 4 && a16 == 8) && a12 == 7) && (a18 <= 134 || (!(3 == input) && a12 == 5)))) || ((((11 <= a16 && !(a16 == 11)) && a15 == 3) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a12 == 5)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((a15 == 4 && a16 == 8) && (\exists v_prenex_3 : int :: ((0 <= 5 * (10 * v_prenex_3 / -5) && v_prenex_3 + 79 <= 0) && 5 <= 5 * (10 * v_prenex_3 / -5)) && 5 * (10 * v_prenex_3 / -5) / 5 <= a18)) && a12 == 6)) || ((a15 == 4 && a16 == 8) && a12 == 5)) || (((a16 <= 11 && a18 <= 134) && a15 == 3) && a12 == 5)) || (136 <= a18 && ((!(a16 == 11) && a15 == 3) && !(5 == a12)) && !(a12 == 7))) || (((a16 <= 11 && a18 + 156 <= 0) && !(a16 == 11)) && a15 == 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 397 locations, 1 error locations. SAFE Result, 192.4s OverallTime, 19 OverallIterations, 13 TraceHistogramMax, 104.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 4500 SDtfs, 31534 SDslu, 2160 SDs, 0 SdLazy, 69780 SolverSat, 4401 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 86.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15209 GetRequests, 15059 SyntacticMatches, 17 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19829occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 8640 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 278 NumberOfFragments, 1705 HoareAnnotationTreeSize, 4 FomulaSimplifications, 57125 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 28745 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 35742 NumberOfCodeBlocks, 35742 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 35714 ConstructedInterpolants, 157 QuantifiedInterpolants, 184098295 SizeOfPredicates, 3 NumberOfNonLiveVariables, 17263 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 115340/118590 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...