java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:37:16,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:37:16,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:37:16,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:37:16,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:37:16,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:37:16,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:37:16,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:37:16,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:37:16,305 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:37:16,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:37:16,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:37:16,307 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:37:16,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:37:16,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:37:16,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:37:16,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:37:16,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:37:16,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:37:16,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:37:16,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:37:16,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:37:16,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:37:16,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:37:16,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:37:16,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:37:16,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:37:16,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:37:16,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:37:16,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:37:16,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:37:16,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:37:16,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:37:16,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:37:16,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:37:16,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:37:16,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:37:16,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:37:16,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:37:16,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:37:16,359 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:37:16,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:37:16,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:37:16,360 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:37:16,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:37:16,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:37:16,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:37:16,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:37:16,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:37:16,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:37:16,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:37:16,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:37:16,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:37:16,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:37:16,363 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:37:16,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:37:16,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:37:16,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:37:16,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:37:16,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:37:16,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:37:16,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:37:16,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:37:16,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:37:16,367 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:37:16,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:37:16,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:37:16,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:37:16,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:37:16,442 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:37:16,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label29_true-unreach-call.c [2018-11-06 21:37:16,505 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11f4bb01/dc659df89f2541ba8b8acb282968622d/FLAG6d270bbb5 [2018-11-06 21:37:17,156 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:37:17,157 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label29_true-unreach-call.c [2018-11-06 21:37:17,181 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11f4bb01/dc659df89f2541ba8b8acb282968622d/FLAG6d270bbb5 [2018-11-06 21:37:17,196 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11f4bb01/dc659df89f2541ba8b8acb282968622d [2018-11-06 21:37:17,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:37:17,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:37:17,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:37:17,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:37:17,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:37:17,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:37:17" (1/1) ... [2018-11-06 21:37:17,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ec1c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:17, skipping insertion in model container [2018-11-06 21:37:17,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:37:17" (1/1) ... [2018-11-06 21:37:17,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:37:17,321 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:37:18,073 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:37:18,080 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:37:18,357 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:37:18,380 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:37:18,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18 WrapperNode [2018-11-06 21:37:18,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:37:18,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:37:18,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:37:18,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:37:18,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:37:18,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:37:18,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:37:18,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:37:18,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... [2018-11-06 21:37:18,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:37:18,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:37:18,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:37:18,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:37:18,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:37:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:37:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:37:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:37:25,478 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:37:25,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:37:25 BoogieIcfgContainer [2018-11-06 21:37:25,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:37:25,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:37:25,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:37:25,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:37:25,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:37:17" (1/3) ... [2018-11-06 21:37:25,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ba3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:37:25, skipping insertion in model container [2018-11-06 21:37:25,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:37:18" (2/3) ... [2018-11-06 21:37:25,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ba3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:37:25, skipping insertion in model container [2018-11-06 21:37:25,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:37:25" (3/3) ... [2018-11-06 21:37:25,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label29_true-unreach-call.c [2018-11-06 21:37:25,498 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:37:25,507 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:37:25,526 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:37:25,567 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:37:25,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:37:25,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:37:25,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:37:25,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:37:25,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:37:25,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:37:25,568 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:37:25,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:37:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states. [2018-11-06 21:37:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-06 21:37:25,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:25,612 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-11-06 21:37:25,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:25,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 84973194, now seen corresponding path program 1 times [2018-11-06 21:37:25,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:25,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:25,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:37:26,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:26,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:37:26,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:37:26,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:37:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:26,095 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 4 states. [2018-11-06 21:37:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:32,232 INFO L93 Difference]: Finished difference Result 1458 states and 2766 transitions. [2018-11-06 21:37:32,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:37:32,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-06 21:37:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:32,262 INFO L225 Difference]: With dead ends: 1458 [2018-11-06 21:37:32,263 INFO L226 Difference]: Without dead ends: 1054 [2018-11-06 21:37:32,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-11-06 21:37:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2018-11-06 21:37:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-06 21:37:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1752 transitions. [2018-11-06 21:37:32,383 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1752 transitions. Word has length 47 [2018-11-06 21:37:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:32,384 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1752 transitions. [2018-11-06 21:37:32,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:37:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1752 transitions. [2018-11-06 21:37:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-06 21:37:32,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:32,393 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-11-06 21:37:32,393 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:32,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2039199834, now seen corresponding path program 1 times [2018-11-06 21:37:32,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:32,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:32,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:33,044 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-11-06 21:37:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:37:33,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:33,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:37:33,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:37:33,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:37:33,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:37:33,199 INFO L87 Difference]: Start difference. First operand 1054 states and 1752 transitions. Second operand 6 states. [2018-11-06 21:37:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:39,708 INFO L93 Difference]: Finished difference Result 3758 states and 6035 transitions. [2018-11-06 21:37:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:37:39,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-06 21:37:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:39,727 INFO L225 Difference]: With dead ends: 3758 [2018-11-06 21:37:39,727 INFO L226 Difference]: Without dead ends: 2706 [2018-11-06 21:37:39,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:37:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2018-11-06 21:37:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2018-11-06 21:37:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2018-11-06 21:37:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4033 transitions. [2018-11-06 21:37:39,808 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4033 transitions. Word has length 127 [2018-11-06 21:37:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:39,808 INFO L480 AbstractCegarLoop]: Abstraction has 2706 states and 4033 transitions. [2018-11-06 21:37:39,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:37:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4033 transitions. [2018-11-06 21:37:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-06 21:37:39,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:39,816 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-11-06 21:37:39,816 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:39,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash -780115498, now seen corresponding path program 1 times [2018-11-06 21:37:39,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:39,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:39,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-06 21:37:40,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:40,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:37:40,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:37:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:37:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:37:40,123 INFO L87 Difference]: Start difference. First operand 2706 states and 4033 transitions. Second operand 3 states. [2018-11-06 21:37:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:43,421 INFO L93 Difference]: Finished difference Result 7058 states and 10936 transitions. [2018-11-06 21:37:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:37:43,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-11-06 21:37:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:43,447 INFO L225 Difference]: With dead ends: 7058 [2018-11-06 21:37:43,447 INFO L226 Difference]: Without dead ends: 4686 [2018-11-06 21:37:43,451 INFO L604 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-11-06 21:37:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2018-11-06 21:37:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4686. [2018-11-06 21:37:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2018-11-06 21:37:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6687 transitions. [2018-11-06 21:37:43,545 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6687 transitions. Word has length 215 [2018-11-06 21:37:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:43,546 INFO L480 AbstractCegarLoop]: Abstraction has 4686 states and 6687 transitions. [2018-11-06 21:37:43,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:37:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6687 transitions. [2018-11-06 21:37:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-06 21:37:43,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:43,550 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-11-06 21:37:43,551 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:43,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 412784454, now seen corresponding path program 1 times [2018-11-06 21:37:43,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:43,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:43,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:43,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:43,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:37:43,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:37:43,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:37:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:37:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:43,838 INFO L87 Difference]: Start difference. First operand 4686 states and 6687 transitions. Second operand 4 states. [2018-11-06 21:37:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:46,531 INFO L93 Difference]: Finished difference Result 10688 states and 15064 transitions. [2018-11-06 21:37:46,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:37:46,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-11-06 21:37:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:46,555 INFO L225 Difference]: With dead ends: 10688 [2018-11-06 21:37:46,555 INFO L226 Difference]: Without dead ends: 4666 [2018-11-06 21:37:46,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2018-11-06 21:37:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2018-11-06 21:37:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2018-11-06 21:37:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 5238 transitions. [2018-11-06 21:37:46,649 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 5238 transitions. Word has length 232 [2018-11-06 21:37:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:46,650 INFO L480 AbstractCegarLoop]: Abstraction has 4666 states and 5238 transitions. [2018-11-06 21:37:46,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:37:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 5238 transitions. [2018-11-06 21:37:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-11-06 21:37:46,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:46,659 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-11-06 21:37:46,660 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:46,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:46,660 INFO L82 PathProgramCache]: Analyzing trace with hash 674704788, now seen corresponding path program 1 times [2018-11-06 21:37:46,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:46,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:46,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:46,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:37:47,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:47,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:37:47,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:37:47,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:37:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:47,260 INFO L87 Difference]: Start difference. First operand 4666 states and 5238 transitions. Second operand 4 states. [2018-11-06 21:37:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:49,598 INFO L93 Difference]: Finished difference Result 9988 states and 11343 transitions. [2018-11-06 21:37:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:37:49,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-11-06 21:37:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:49,620 INFO L225 Difference]: With dead ends: 9988 [2018-11-06 21:37:49,620 INFO L226 Difference]: Without dead ends: 5986 [2018-11-06 21:37:49,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:37:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2018-11-06 21:37:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 5986. [2018-11-06 21:37:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2018-11-06 21:37:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 6494 transitions. [2018-11-06 21:37:49,715 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 6494 transitions. Word has length 380 [2018-11-06 21:37:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:49,716 INFO L480 AbstractCegarLoop]: Abstraction has 5986 states and 6494 transitions. [2018-11-06 21:37:49,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:37:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 6494 transitions. [2018-11-06 21:37:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-06 21:37:49,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:49,726 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-11-06 21:37:49,726 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:49,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1154717440, now seen corresponding path program 1 times [2018-11-06 21:37:49,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:49,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:49,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:50,151 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:37:50,525 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 21:37:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-06 21:37:50,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:37:50,891 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:37:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:51,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:37:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-06 21:37:51,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:37:51,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-11-06 21:37:51,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:37:51,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:37:51,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:37:51,409 INFO L87 Difference]: Start difference. First operand 5986 states and 6494 transitions. Second operand 8 states. [2018-11-06 21:37:52,714 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:37:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:37:56,590 INFO L93 Difference]: Finished difference Result 13947 states and 15117 transitions. [2018-11-06 21:37:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:37:56,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 388 [2018-11-06 21:37:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:37:56,633 INFO L225 Difference]: With dead ends: 13947 [2018-11-06 21:37:56,633 INFO L226 Difference]: Without dead ends: 9614 [2018-11-06 21:37:56,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:37:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9614 states. [2018-11-06 21:37:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9614 to 9614. [2018-11-06 21:37:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2018-11-06 21:37:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 10209 transitions. [2018-11-06 21:37:56,821 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 10209 transitions. Word has length 388 [2018-11-06 21:37:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:37:56,822 INFO L480 AbstractCegarLoop]: Abstraction has 9614 states and 10209 transitions. [2018-11-06 21:37:56,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:37:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 10209 transitions. [2018-11-06 21:37:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-11-06 21:37:56,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:37:56,841 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-11-06 21:37:56,841 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:37:56,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:37:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash 963790717, now seen corresponding path program 1 times [2018-11-06 21:37:56,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:37:56,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:37:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:37:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:37:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:37:57,207 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:37:57,656 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-06 21:37:58,124 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-11-06 21:37:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-06 21:37:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:37:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:37:58,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:37:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:37:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:37:58,810 INFO L87 Difference]: Start difference. First operand 9614 states and 10209 transitions. Second operand 7 states. [2018-11-06 21:38:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:02,888 INFO L93 Difference]: Finished difference Result 17344 states and 18462 transitions. [2018-11-06 21:38:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:38:02,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 502 [2018-11-06 21:38:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:02,908 INFO L225 Difference]: With dead ends: 17344 [2018-11-06 21:38:02,908 INFO L226 Difference]: Without dead ends: 9713 [2018-11-06 21:38:02,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:38:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9713 states. [2018-11-06 21:38:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9713 to 9614. [2018-11-06 21:38:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2018-11-06 21:38:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 10205 transitions. [2018-11-06 21:38:03,047 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 10205 transitions. Word has length 502 [2018-11-06 21:38:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:03,047 INFO L480 AbstractCegarLoop]: Abstraction has 9614 states and 10205 transitions. [2018-11-06 21:38:03,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:38:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 10205 transitions. [2018-11-06 21:38:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-11-06 21:38:03,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:03,076 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-11-06 21:38:03,076 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:03,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1440214053, now seen corresponding path program 1 times [2018-11-06 21:38:03,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:03,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:03,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:03,579 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:38:03,949 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 21:38:04,384 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-06 21:38:05,134 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2018-11-06 21:38:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 825 proven. 130 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-06 21:38:06,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:38:06,246 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:38:06,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:06,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:38:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-11-06 21:38:07,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:38:07,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-11-06 21:38:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:38:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:38:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:38:07,022 INFO L87 Difference]: Start difference. First operand 9614 states and 10205 transitions. Second operand 11 states. [2018-11-06 21:38:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:13,765 INFO L93 Difference]: Finished difference Result 18587 states and 19729 transitions. [2018-11-06 21:38:13,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:38:13,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 711 [2018-11-06 21:38:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:13,786 INFO L225 Difference]: With dead ends: 18587 [2018-11-06 21:38:13,786 INFO L226 Difference]: Without dead ends: 9626 [2018-11-06 21:38:13,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2018-11-06 21:38:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2018-11-06 21:38:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 8944. [2018-11-06 21:38:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8944 states. [2018-11-06 21:38:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 9306 transitions. [2018-11-06 21:38:13,909 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 9306 transitions. Word has length 711 [2018-11-06 21:38:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:13,910 INFO L480 AbstractCegarLoop]: Abstraction has 8944 states and 9306 transitions. [2018-11-06 21:38:13,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:38:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 9306 transitions. [2018-11-06 21:38:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2018-11-06 21:38:13,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:13,926 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-11-06 21:38:13,926 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:13,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1444696310, now seen corresponding path program 1 times [2018-11-06 21:38:13,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:13,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:13,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:14,502 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:38:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1290 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-06 21:38:14,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:38:14,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:38:14,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:38:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:38:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:38:14,863 INFO L87 Difference]: Start difference. First operand 8944 states and 9306 transitions. Second operand 4 states. [2018-11-06 21:38:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:16,700 INFO L93 Difference]: Finished difference Result 16235 states and 16930 transitions. [2018-11-06 21:38:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:38:16,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 837 [2018-11-06 21:38:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:16,716 INFO L225 Difference]: With dead ends: 16235 [2018-11-06 21:38:16,716 INFO L226 Difference]: Without dead ends: 8610 [2018-11-06 21:38:16,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:38:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8610 states. [2018-11-06 21:38:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8610 to 8610. [2018-11-06 21:38:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8610 states. [2018-11-06 21:38:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8610 states to 8610 states and 8862 transitions. [2018-11-06 21:38:16,824 INFO L78 Accepts]: Start accepts. Automaton has 8610 states and 8862 transitions. Word has length 837 [2018-11-06 21:38:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:16,825 INFO L480 AbstractCegarLoop]: Abstraction has 8610 states and 8862 transitions. [2018-11-06 21:38:16,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:38:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 8610 states and 8862 transitions. [2018-11-06 21:38:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-11-06 21:38:16,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:16,848 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-11-06 21:38:16,848 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:16,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -482303900, now seen corresponding path program 1 times [2018-11-06 21:38:16,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:16,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:16,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:17,612 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 21:38:17,785 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:38:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1131 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2018-11-06 21:38:19,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:38:19,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:38:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:38:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:38:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:38:19,229 INFO L87 Difference]: Start difference. First operand 8610 states and 8862 transitions. Second operand 6 states. [2018-11-06 21:38:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:22,625 INFO L93 Difference]: Finished difference Result 15571 states and 16055 transitions. [2018-11-06 21:38:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:38:22,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1067 [2018-11-06 21:38:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:22,642 INFO L225 Difference]: With dead ends: 15571 [2018-11-06 21:38:22,642 INFO L226 Difference]: Without dead ends: 9274 [2018-11-06 21:38:22,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:38:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9274 states. [2018-11-06 21:38:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9274 to 8940. [2018-11-06 21:38:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8940 states. [2018-11-06 21:38:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8940 states to 8940 states and 9198 transitions. [2018-11-06 21:38:22,759 INFO L78 Accepts]: Start accepts. Automaton has 8940 states and 9198 transitions. Word has length 1067 [2018-11-06 21:38:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:22,761 INFO L480 AbstractCegarLoop]: Abstraction has 8940 states and 9198 transitions. [2018-11-06 21:38:22,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:38:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8940 states and 9198 transitions. [2018-11-06 21:38:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-11-06 21:38:22,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:22,784 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-11-06 21:38:22,785 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:22,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 667165986, now seen corresponding path program 1 times [2018-11-06 21:38:22,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2595 backedges. 1347 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2018-11-06 21:38:24,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:38:24,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:38:24,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:38:24,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:38:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:38:24,136 INFO L87 Difference]: Start difference. First operand 8940 states and 9198 transitions. Second operand 4 states. [2018-11-06 21:38:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:26,341 INFO L93 Difference]: Finished difference Result 23158 states and 23834 transitions. [2018-11-06 21:38:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:38:26,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1094 [2018-11-06 21:38:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:26,360 INFO L225 Difference]: With dead ends: 23158 [2018-11-06 21:38:26,360 INFO L226 Difference]: Without dead ends: 13557 [2018-11-06 21:38:26,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:38:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13557 states. [2018-11-06 21:38:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13557 to 13557. [2018-11-06 21:38:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13557 states. [2018-11-06 21:38:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13557 states to 13557 states and 13855 transitions. [2018-11-06 21:38:26,564 INFO L78 Accepts]: Start accepts. Automaton has 13557 states and 13855 transitions. Word has length 1094 [2018-11-06 21:38:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:26,565 INFO L480 AbstractCegarLoop]: Abstraction has 13557 states and 13855 transitions. [2018-11-06 21:38:26,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:38:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13557 states and 13855 transitions. [2018-11-06 21:38:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1206 [2018-11-06 21:38:26,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:26,601 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-11-06 21:38:26,601 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:26,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:26,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1589890281, now seen corresponding path program 1 times [2018-11-06 21:38:26,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:26,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:26,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:26,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:26,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1004 proven. 0 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2018-11-06 21:38:28,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:38:28,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:38:28,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:38:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:38:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:38:28,266 INFO L87 Difference]: Start difference. First operand 13557 states and 13855 transitions. Second operand 4 states. [2018-11-06 21:38:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:30,214 INFO L93 Difference]: Finished difference Result 24141 states and 24700 transitions. [2018-11-06 21:38:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:38:30,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1205 [2018-11-06 21:38:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:30,232 INFO L225 Difference]: With dead ends: 24141 [2018-11-06 21:38:30,233 INFO L226 Difference]: Without dead ends: 12557 [2018-11-06 21:38:30,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:38:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2018-11-06 21:38:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12557. [2018-11-06 21:38:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12557 states. [2018-11-06 21:38:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12557 states to 12557 states and 12772 transitions. [2018-11-06 21:38:30,406 INFO L78 Accepts]: Start accepts. Automaton has 12557 states and 12772 transitions. Word has length 1205 [2018-11-06 21:38:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:30,407 INFO L480 AbstractCegarLoop]: Abstraction has 12557 states and 12772 transitions. [2018-11-06 21:38:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:38:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12557 states and 12772 transitions. [2018-11-06 21:38:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1286 [2018-11-06 21:38:30,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:30,438 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-11-06 21:38:30,439 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:30,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1009892641, now seen corresponding path program 1 times [2018-11-06 21:38:30,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:30,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:30,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:30,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:30,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 1989 proven. 310 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-11-06 21:38:33,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:38:33,009 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:38:33,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:33,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:38:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2271 proven. 28 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-11-06 21:38:34,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:38:34,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2018-11-06 21:38:34,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:38:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:38:34,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:38:34,679 INFO L87 Difference]: Start difference. First operand 12557 states and 12772 transitions. Second operand 7 states. [2018-11-06 21:38:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:38,432 INFO L93 Difference]: Finished difference Result 22141 states and 22534 transitions. [2018-11-06 21:38:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:38:38,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1285 [2018-11-06 21:38:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:38,450 INFO L225 Difference]: With dead ends: 22141 [2018-11-06 21:38:38,450 INFO L226 Difference]: Without dead ends: 12557 [2018-11-06 21:38:38,459 INFO L604 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-11-06 21:38:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2018-11-06 21:38:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12227. [2018-11-06 21:38:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12227 states. [2018-11-06 21:38:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12227 states to 12227 states and 12422 transitions. [2018-11-06 21:38:38,587 INFO L78 Accepts]: Start accepts. Automaton has 12227 states and 12422 transitions. Word has length 1285 [2018-11-06 21:38:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:38,589 INFO L480 AbstractCegarLoop]: Abstraction has 12227 states and 12422 transitions. [2018-11-06 21:38:38,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:38:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12227 states and 12422 transitions. [2018-11-06 21:38:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1792 [2018-11-06 21:38:38,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:38,632 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-11-06 21:38:38,632 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:38,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash 262554205, now seen corresponding path program 1 times [2018-11-06 21:38:38,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:38,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:38,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:38,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:38,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:40,229 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 21:38:40,480 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:38:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 4482 proven. 151 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2018-11-06 21:38:43,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:38:43,565 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:38:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:43,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:38:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 3297 proven. 0 refuted. 0 times theorem prover too weak. 2317 trivial. 0 not checked. [2018-11-06 21:38:46,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:38:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-06 21:38:46,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:38:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:38:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:38:46,292 INFO L87 Difference]: Start difference. First operand 12227 states and 12422 transitions. Second operand 11 states. [2018-11-06 21:38:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:38:52,769 INFO L93 Difference]: Finished difference Result 22258 states and 22642 transitions. [2018-11-06 21:38:52,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:38:52,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1791 [2018-11-06 21:38:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:38:52,782 INFO L225 Difference]: With dead ends: 22258 [2018-11-06 21:38:52,782 INFO L226 Difference]: Without dead ends: 13004 [2018-11-06 21:38:52,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1816 GetRequests, 1798 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:38:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13004 states. [2018-11-06 21:38:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13004 to 12887. [2018-11-06 21:38:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12887 states. [2018-11-06 21:38:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12887 states to 12887 states and 13093 transitions. [2018-11-06 21:38:52,903 INFO L78 Accepts]: Start accepts. Automaton has 12887 states and 13093 transitions. Word has length 1791 [2018-11-06 21:38:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:38:52,904 INFO L480 AbstractCegarLoop]: Abstraction has 12887 states and 13093 transitions. [2018-11-06 21:38:52,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:38:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 12887 states and 13093 transitions. [2018-11-06 21:38:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1954 [2018-11-06 21:38:52,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:38:52,938 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-11-06 21:38:52,938 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:38:52,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:38:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1643629548, now seen corresponding path program 1 times [2018-11-06 21:38:52,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:38:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:38:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:38:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:54,097 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:38:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 2799 proven. 243 refuted. 0 times theorem prover too weak. 3835 trivial. 0 not checked. [2018-11-06 21:38:58,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:38:58,046 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:38:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:38:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:38:58,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:39:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 2799 proven. 0 refuted. 0 times theorem prover too weak. 4078 trivial. 0 not checked. [2018-11-06 21:39:00,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:39:00,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-11-06 21:39:00,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:39:00,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:39:00,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:39:00,939 INFO L87 Difference]: Start difference. First operand 12887 states and 13093 transitions. Second operand 10 states. [2018-11-06 21:39:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:39:08,083 INFO L93 Difference]: Finished difference Result 24125 states and 24536 transitions. [2018-11-06 21:39:08,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:39:08,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1953 [2018-11-06 21:39:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:39:08,097 INFO L225 Difference]: With dead ends: 24125 [2018-11-06 21:39:08,097 INFO L226 Difference]: Without dead ends: 13218 [2018-11-06 21:39:08,105 INFO L604 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-11-06 21:39:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13218 states. [2018-11-06 21:39:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13218 to 12223. [2018-11-06 21:39:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12223 states. [2018-11-06 21:39:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12223 states to 12223 states and 12427 transitions. [2018-11-06 21:39:08,225 INFO L78 Accepts]: Start accepts. Automaton has 12223 states and 12427 transitions. Word has length 1953 [2018-11-06 21:39:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:39:08,226 INFO L480 AbstractCegarLoop]: Abstraction has 12223 states and 12427 transitions. [2018-11-06 21:39:08,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:39:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 12223 states and 12427 transitions. [2018-11-06 21:39:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1985 [2018-11-06 21:39:08,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:39:08,255 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-11-06 21:39:08,256 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:39:08,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:39:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash 597701559, now seen corresponding path program 1 times [2018-11-06 21:39:08,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:39:08,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:39:08,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:08,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:08,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:39:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7621 backedges. 2706 proven. 158 refuted. 0 times theorem prover too weak. 4757 trivial. 0 not checked. [2018-11-06 21:39:11,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:39:11,773 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:39:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:39:12,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:39:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7621 backedges. 2864 proven. 0 refuted. 0 times theorem prover too weak. 4757 trivial. 0 not checked. [2018-11-06 21:39:14,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:39:14,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 21:39:14,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:39:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:39:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:39:14,461 INFO L87 Difference]: Start difference. First operand 12223 states and 12427 transitions. Second operand 10 states. [2018-11-06 21:39:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:39:21,349 INFO L93 Difference]: Finished difference Result 30175 states and 30736 transitions. [2018-11-06 21:39:21,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:39:21,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1984 [2018-11-06 21:39:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:39:21,366 INFO L225 Difference]: With dead ends: 30175 [2018-11-06 21:39:21,366 INFO L226 Difference]: Without dead ends: 18966 [2018-11-06 21:39:21,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2012 GetRequests, 1993 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:39:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18966 states. [2018-11-06 21:39:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18966 to 16183. [2018-11-06 21:39:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16183 states. [2018-11-06 21:39:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16183 states to 16183 states and 16438 transitions. [2018-11-06 21:39:21,535 INFO L78 Accepts]: Start accepts. Automaton has 16183 states and 16438 transitions. Word has length 1984 [2018-11-06 21:39:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:39:21,536 INFO L480 AbstractCegarLoop]: Abstraction has 16183 states and 16438 transitions. [2018-11-06 21:39:21,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:39:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16183 states and 16438 transitions. [2018-11-06 21:39:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2048 [2018-11-06 21:39:21,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:39:21,570 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-11-06 21:39:21,570 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:39:21,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:39:21,571 INFO L82 PathProgramCache]: Analyzing trace with hash 86088019, now seen corresponding path program 1 times [2018-11-06 21:39:21,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:39:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:39:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:39:22,743 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:39:23,090 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-06 21:39:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7932 backedges. 4278 proven. 1877 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-06 21:39:26,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:39:26,281 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:39:26,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:39:26,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:39:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7932 backedges. 4413 proven. 0 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2018-11-06 21:39:28,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:39:28,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-11-06 21:39:28,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:39:28,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:39:28,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:39:28,731 INFO L87 Difference]: Start difference. First operand 16183 states and 16438 transitions. Second operand 11 states. [2018-11-06 21:39:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:39:36,275 INFO L93 Difference]: Finished difference Result 32694 states and 33223 transitions. [2018-11-06 21:39:36,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:39:36,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2047 [2018-11-06 21:39:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:39:36,292 INFO L225 Difference]: With dead ends: 32694 [2018-11-06 21:39:36,292 INFO L226 Difference]: Without dead ends: 17833 [2018-11-06 21:39:36,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2061 GetRequests, 2049 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:39:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2018-11-06 21:39:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 17173. [2018-11-06 21:39:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17173 states. [2018-11-06 21:39:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17173 states to 17173 states and 17436 transitions. [2018-11-06 21:39:36,473 INFO L78 Accepts]: Start accepts. Automaton has 17173 states and 17436 transitions. Word has length 2047 [2018-11-06 21:39:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:39:36,474 INFO L480 AbstractCegarLoop]: Abstraction has 17173 states and 17436 transitions. [2018-11-06 21:39:36,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:39:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17173 states and 17436 transitions. [2018-11-06 21:39:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2261 [2018-11-06 21:39:36,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:39:36,520 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-11-06 21:39:36,520 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:39:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:39:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1498146993, now seen corresponding path program 1 times [2018-11-06 21:39:36,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:39:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:39:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:36,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:39:37,863 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:39:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9172 backedges. 4005 proven. 251 refuted. 0 times theorem prover too weak. 4916 trivial. 0 not checked. [2018-11-06 21:39:42,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:39:42,969 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:39:42,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:39:43,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:39:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9172 backedges. 5036 proven. 0 refuted. 0 times theorem prover too weak. 4136 trivial. 0 not checked. [2018-11-06 21:39:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:39:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 21:39:46,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:39:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:39:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:39:46,921 INFO L87 Difference]: Start difference. First operand 17173 states and 17436 transitions. Second operand 10 states. [2018-11-06 21:39:51,029 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-06 21:39:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:39:57,318 INFO L93 Difference]: Finished difference Result 38480 states and 39121 transitions. [2018-11-06 21:39:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:39:57,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2260 [2018-11-06 21:39:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:39:57,338 INFO L225 Difference]: With dead ends: 38480 [2018-11-06 21:39:57,338 INFO L226 Difference]: Without dead ends: 22469 [2018-11-06 21:39:57,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2283 GetRequests, 2265 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:39:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22469 states. [2018-11-06 21:39:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22469 to 19829. [2018-11-06 21:39:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19829 states. [2018-11-06 21:39:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 20095 transitions. [2018-11-06 21:39:57,562 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 20095 transitions. Word has length 2260 [2018-11-06 21:39:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:39:57,563 INFO L480 AbstractCegarLoop]: Abstraction has 19829 states and 20095 transitions. [2018-11-06 21:39:57,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:39:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 20095 transitions. [2018-11-06 21:39:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2018-11-06 21:39:57,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:39:57,609 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-11-06 21:39:57,609 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:39:57,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:39:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -178663838, now seen corresponding path program 1 times [2018-11-06 21:39:57,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:39:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:39:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:39:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:39:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:40:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 2578 proven. 45 refuted. 0 times theorem prover too weak. 9727 trivial. 0 not checked. [2018-11-06 21:40:02,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:40:02,499 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:40:02,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:40:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:40:03,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:40:03,327 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2018-11-06 21:40:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 2578 proven. 45 refuted. 0 times theorem prover too weak. 9727 trivial. 0 not checked. [2018-11-06 21:40:06,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:40:06,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-06 21:40:06,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:40:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:40:06,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:40:06,275 INFO L87 Difference]: Start difference. First operand 19829 states and 20095 transitions. Second operand 6 states. [2018-11-06 21:40:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:40:11,545 INFO L93 Difference]: Finished difference Result 38333 states and 38860 transitions. [2018-11-06 21:40:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:40:11,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2599 [2018-11-06 21:40:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:40:11,546 INFO L225 Difference]: With dead ends: 38333 [2018-11-06 21:40:11,546 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:40:11,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2603 GetRequests, 2599 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:40:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:40:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:40:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:40:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:40:11,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2599 [2018-11-06 21:40:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:40:11,564 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:40:11,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:40:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:40:11,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:40:11,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:40:11,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:11,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,511 WARN L179 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 370 [2018-11-06 21:40:12,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,721 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 201 [2018-11-06 21:40:12,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:12,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:40:13,453 WARN L179 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 545 DAG size of output: 371 [2018-11-06 21:40:17,000 WARN L179 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 322 DAG size of output: 113 [2018-11-06 21:40:18,783 WARN L179 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 194 DAG size of output: 118 [2018-11-06 21:40:21,760 WARN L179 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 322 DAG size of output: 113 [2018-11-06 21:40:21,762 INFO L425 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,762 INFO L425 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,762 INFO L425 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,762 INFO L425 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,762 INFO L425 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L168(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L102(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L36(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:40:21,763 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:40:21,764 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-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L171(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L105(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,764 INFO L425 ceAbstractionStarter]: For program point L39(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,765 INFO L425 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L174(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L108(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L42(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,766 INFO L425 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:40:21,767 INFO L425 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L177(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L111(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L45(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,768 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,769 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,769 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:40:21,769 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:40:21,769 INFO L425 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,769 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:40:21,769 INFO L425 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,770 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-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,770 INFO L425 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L180(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L114(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L48(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:40:21,771 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L428 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L183(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L117(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L51(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,772 INFO L425 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,773 INFO L425 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,774 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L186(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L120(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L54(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:40:21,775 INFO L425 ceAbstractionStarter]: For program point L1773-1(lines 1773 1782) no Hoare annotation was computed. [2018-11-06 21:40:21,776 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-11-06 21:40:21,776 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,776 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,776 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,776 INFO L425 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,776 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,776 INFO L425 ceAbstractionStarter]: For program point L189(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L123(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L57(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,777 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,778 INFO L425 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L192(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L126(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L60(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,779 INFO L425 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,780 INFO L425 ceAbstractionStarter]: For program point L195(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L129(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L63(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:40:21,781 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,782 INFO L425 ceAbstractionStarter]: For program point L198(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L132(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L66(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,783 INFO L425 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L201(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L135(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L69(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,784 INFO L425 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,785 INFO L425 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L204(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L138(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L72(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-06 21:40:21,786 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L141(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,787 INFO L425 ceAbstractionStarter]: For program point L75(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,788 INFO L425 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L78(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,789 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,790 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L147(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L81(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,791 INFO L425 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,792 INFO L425 ceAbstractionStarter]: For program point L150(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L84(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:40:21,793 INFO L425 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L153(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L87(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,794 INFO L425 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,795 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L156(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L90(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:40:21,796 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L159(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,797 INFO L425 ceAbstractionStarter]: For program point L93(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L27(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,798 INFO L425 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L162(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L96(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L30(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,799 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,800 INFO L425 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L165(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L99(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L33(lines 23 1492) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:40:21,801 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,802 INFO L425 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-11-06 21:40:21,802 INFO L425 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,802 INFO L425 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-11-06 21:40:21,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,813 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,813 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,813 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,818 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,818 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,818 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,819 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,833 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,833 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,834 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,834 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,834 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,835 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,835 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,835 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,836 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,836 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,836 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,837 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,837 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,837 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,838 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,838 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,838 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,838 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,839 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,839 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,842 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,842 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,843 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,843 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,843 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,844 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,844 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,844 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,845 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,845 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,845 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,846 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,846 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,846 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,847 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,847 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,847 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,847 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,848 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,848 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,850 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,850 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,850 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,851 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,852 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,852 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,852 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,853 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,853 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,853 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,854 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,854 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,854 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,855 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,855 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,855 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,855 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,856 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,858 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,858 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,858 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,859 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,859 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,859 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,860 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,860 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,860 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,860 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,861 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,861 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,862 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,862 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,862 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,862 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,863 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,863 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,863 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,863 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,865 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,865 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,865 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,865 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,866 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,866 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,866 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,867 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,867 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,867 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,868 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,868 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,868 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,868 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:40:21 BoogieIcfgContainer [2018-11-06 21:40:21,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:40:21,874 INFO L168 Benchmark]: Toolchain (without parser) took 184668.90 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.3 GB in the end (delta: -936.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:40:21,876 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:40:21,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1173.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:40:21,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 362.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:40:21,878 INFO L168 Benchmark]: Boogie Preprocessor took 213.98 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-11-06 21:40:21,878 INFO L168 Benchmark]: RCFGBuilder took 6519.82 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: 255.9 MB). Peak memory consumption was 255.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:40:21,879 INFO L168 Benchmark]: TraceAbstraction took 176393.43 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -428.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:40:21,885 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1173.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 362.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.98 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 6519.82 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: 255.9 MB). Peak memory consumption was 255.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176393.43 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -428.3 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-11-06 21:40:21,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,912 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,912 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-11-06 21:40:21,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,925 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-11-06 21:40:21,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,932 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_904,QUANTIFIED] [2018-11-06 21:40:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:40:21,937 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, 176.2s OverallTime, 19 OverallIterations, 13 TraceHistogramMax, 94.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4500 SDtfs, 31534 SDslu, 2160 SDs, 0 SdLazy, 69782 SolverSat, 4401 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15209 GetRequests, 15059 SyntacticMatches, 17 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 11.8s 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.3s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 36.2s 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...