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/Problem11_label50_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:06:10,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:06:10,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:06:10,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:06:10,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:06:10,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:06:10,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:06:10,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:06:10,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:06:10,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:06:10,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:06:10,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:06:10,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:06:10,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:06:10,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:06:10,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:06:10,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:06:10,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:06:10,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:06:10,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:06:10,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:06:10,690 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:06:10,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:06:10,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:06:10,693 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:06:10,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:06:10,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:06:10,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:06:10,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:06:10,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:06:10,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:06:10,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:06:10,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:06:10,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:06:10,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:06:10,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:06:10,701 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:06:10,719 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:06:10,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:06:10,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:06:10,721 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:06:10,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:06:10,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:06:10,722 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:06:10,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:06:10,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:06:10,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:06:10,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:06:10,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:06:10,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:06:10,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:06:10,723 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:06:10,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:06:10,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:06:10,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:06:10,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:06:10,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:06:10,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:06:10,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:06:10,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:06:10,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:06:10,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:06:10,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:06:10,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:06:10,726 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:06:10,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:06:10,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:06:10,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:06:10,805 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:06:10,806 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:06:10,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label50_true-unreach-call.c [2018-11-06 21:06:10,881 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88053db1/51d506ca1bbe4627a742e79d909f8d81/FLAGf6b8b48b4 [2018-11-06 21:06:11,561 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:06:11,564 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label50_true-unreach-call.c [2018-11-06 21:06:11,578 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88053db1/51d506ca1bbe4627a742e79d909f8d81/FLAGf6b8b48b4 [2018-11-06 21:06:11,593 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88053db1/51d506ca1bbe4627a742e79d909f8d81 [2018-11-06 21:06:11,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:06:11,606 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:06:11,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:06:11,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:06:11,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:06:11,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:06:11" (1/1) ... [2018-11-06 21:06:11,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ab8b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:11, skipping insertion in model container [2018-11-06 21:06:11,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:06:11" (1/1) ... [2018-11-06 21:06:11,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:06:11,701 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:06:12,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:06:12,430 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:06:12,636 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:06:12,659 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:06:12,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12 WrapperNode [2018-11-06 21:06:12,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:06:12,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:06:12,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:06:12,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:06:12,670 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:06:12" (1/1) ... [2018-11-06 21:06:12,810 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:06:12" (1/1) ... [2018-11-06 21:06:12,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:06:12,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:06:12,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:06:12,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:06:12,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:12,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:12,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:12,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:13,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:13,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:13,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (1/1) ... [2018-11-06 21:06:13,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:06:13,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:06:13,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:06:13,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:06:13,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (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:06:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:06:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:06:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:06:18,058 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:06:18,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:06:18 BoogieIcfgContainer [2018-11-06 21:06:18,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:06:18,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:06:18,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:06:18,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:06:18,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:06:11" (1/3) ... [2018-11-06 21:06:18,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae7d092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:06:18, skipping insertion in model container [2018-11-06 21:06:18,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:06:12" (2/3) ... [2018-11-06 21:06:18,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae7d092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:06:18, skipping insertion in model container [2018-11-06 21:06:18,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:06:18" (3/3) ... [2018-11-06 21:06:18,068 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label50_true-unreach-call.c [2018-11-06 21:06:18,079 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:06:18,089 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:06:18,105 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:06:18,142 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:06:18,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:06:18,143 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:06:18,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:06:18,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:06:18,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:06:18,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:06:18,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:06:18,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:06:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:06:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-06 21:06:18,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:18,184 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] [2018-11-06 21:06:18,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:18,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 680225122, now seen corresponding path program 1 times [2018-11-06 21:06:18,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:18,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:18,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:18,647 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:06:18,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:18,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:06:18,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:06:18,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:06:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:18,682 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:06:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:22,172 INFO L93 Difference]: Finished difference Result 977 states and 1747 transitions. [2018-11-06 21:06:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:06:22,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-06 21:06:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:22,199 INFO L225 Difference]: With dead ends: 977 [2018-11-06 21:06:22,200 INFO L226 Difference]: Without dead ends: 686 [2018-11-06 21:06:22,205 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:06:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-06 21:06:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 683. [2018-11-06 21:06:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-11-06 21:06:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1060 transitions. [2018-11-06 21:06:22,298 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1060 transitions. Word has length 37 [2018-11-06 21:06:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:22,299 INFO L480 AbstractCegarLoop]: Abstraction has 683 states and 1060 transitions. [2018-11-06 21:06:22,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:06:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1060 transitions. [2018-11-06 21:06:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-06 21:06:22,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:22,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:22,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:22,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1815459254, now seen corresponding path program 1 times [2018-11-06 21:06:22,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:22,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:22,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:22,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:22,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:22,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:22,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:06:22,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:06:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:06:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:22,579 INFO L87 Difference]: Start difference. First operand 683 states and 1060 transitions. Second operand 4 states. [2018-11-06 21:06:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:27,368 INFO L93 Difference]: Finished difference Result 2492 states and 3982 transitions. [2018-11-06 21:06:27,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:06:27,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-06 21:06:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:27,381 INFO L225 Difference]: With dead ends: 2492 [2018-11-06 21:06:27,382 INFO L226 Difference]: Without dead ends: 1811 [2018-11-06 21:06:27,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-06 21:06:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1795. [2018-11-06 21:06:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-11-06 21:06:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2640 transitions. [2018-11-06 21:06:27,483 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2640 transitions. Word has length 106 [2018-11-06 21:06:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:27,483 INFO L480 AbstractCegarLoop]: Abstraction has 1795 states and 2640 transitions. [2018-11-06 21:06:27,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:06:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2640 transitions. [2018-11-06 21:06:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 21:06:27,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:27,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:27,494 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:27,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -759476949, now seen corresponding path program 1 times [2018-11-06 21:06:27,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:27,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:27,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:27,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:27,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:06:27,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:06:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:06:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:27,744 INFO L87 Difference]: Start difference. First operand 1795 states and 2640 transitions. Second operand 4 states. [2018-11-06 21:06:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:30,286 INFO L93 Difference]: Finished difference Result 6742 states and 10027 transitions. [2018-11-06 21:06:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:06:30,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-06 21:06:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:30,313 INFO L225 Difference]: With dead ends: 6742 [2018-11-06 21:06:30,313 INFO L226 Difference]: Without dead ends: 4949 [2018-11-06 21:06:30,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2018-11-06 21:06:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4949. [2018-11-06 21:06:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2018-11-06 21:06:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 6496 transitions. [2018-11-06 21:06:30,410 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 6496 transitions. Word has length 132 [2018-11-06 21:06:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:30,411 INFO L480 AbstractCegarLoop]: Abstraction has 4949 states and 6496 transitions. [2018-11-06 21:06:30,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:06:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 6496 transitions. [2018-11-06 21:06:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-06 21:06:30,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:30,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:30,414 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:30,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1823808628, now seen corresponding path program 1 times [2018-11-06 21:06:30,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:30,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:30,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:30,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:30,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:06:30,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:06:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:06:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:30,833 INFO L87 Difference]: Start difference. First operand 4949 states and 6496 transitions. Second operand 4 states. [2018-11-06 21:06:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:37,277 INFO L93 Difference]: Finished difference Result 11401 states and 15111 transitions. [2018-11-06 21:06:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:06:37,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-11-06 21:06:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:37,308 INFO L225 Difference]: With dead ends: 11401 [2018-11-06 21:06:37,309 INFO L226 Difference]: Without dead ends: 6639 [2018-11-06 21:06:37,316 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:06:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2018-11-06 21:06:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 6615. [2018-11-06 21:06:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6615 states. [2018-11-06 21:06:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 8370 transitions. [2018-11-06 21:06:37,510 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 8370 transitions. Word has length 165 [2018-11-06 21:06:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:37,511 INFO L480 AbstractCegarLoop]: Abstraction has 6615 states and 8370 transitions. [2018-11-06 21:06:37,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:06:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 8370 transitions. [2018-11-06 21:06:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 21:06:37,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:37,519 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:06:37,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:37,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1696192220, now seen corresponding path program 1 times [2018-11-06 21:06:37,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:37,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:37,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 90 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:38,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:06:38,157 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:06:38,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:38,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 69 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:39,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:39,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-11-06 21:06:39,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:06:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:06:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:06:39,284 INFO L87 Difference]: Start difference. First operand 6615 states and 8370 transitions. Second operand 8 states. [2018-11-06 21:06:39,647 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2018-11-06 21:06:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:50,152 INFO L93 Difference]: Finished difference Result 27756 states and 35762 transitions. [2018-11-06 21:06:50,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:06:50,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2018-11-06 21:06:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:50,234 INFO L225 Difference]: With dead ends: 27756 [2018-11-06 21:06:50,235 INFO L226 Difference]: Without dead ends: 21328 [2018-11-06 21:06:50,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-06 21:06:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21328 states. [2018-11-06 21:06:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21328 to 18700. [2018-11-06 21:06:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18700 states. [2018-11-06 21:06:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18700 states to 18700 states and 22521 transitions. [2018-11-06 21:06:50,622 INFO L78 Accepts]: Start accepts. Automaton has 18700 states and 22521 transitions. Word has length 251 [2018-11-06 21:06:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:50,623 INFO L480 AbstractCegarLoop]: Abstraction has 18700 states and 22521 transitions. [2018-11-06 21:06:50,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:06:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18700 states and 22521 transitions. [2018-11-06 21:06:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 21:06:50,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:50,632 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:06:50,632 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:50,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:50,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1649115641, now seen corresponding path program 1 times [2018-11-06 21:06:50,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:50,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:50,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:51,080 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 21:06:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:51,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:51,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:06:51,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:06:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:06:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:06:51,163 INFO L87 Difference]: Start difference. First operand 18700 states and 22521 transitions. Second operand 5 states. [2018-11-06 21:06:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:55,185 INFO L93 Difference]: Finished difference Result 51142 states and 62154 transitions. [2018-11-06 21:06:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:06:55,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2018-11-06 21:06:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:55,236 INFO L225 Difference]: With dead ends: 51142 [2018-11-06 21:06:55,237 INFO L226 Difference]: Without dead ends: 24004 [2018-11-06 21:06:55,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:06:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24004 states. [2018-11-06 21:06:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24004 to 22892. [2018-11-06 21:06:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22892 states. [2018-11-06 21:06:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22892 states to 22892 states and 25942 transitions. [2018-11-06 21:06:55,587 INFO L78 Accepts]: Start accepts. Automaton has 22892 states and 25942 transitions. Word has length 251 [2018-11-06 21:06:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:55,587 INFO L480 AbstractCegarLoop]: Abstraction has 22892 states and 25942 transitions. [2018-11-06 21:06:55,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:06:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22892 states and 25942 transitions. [2018-11-06 21:06:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-06 21:06:55,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:55,594 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:06:55,594 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:55,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1541679735, now seen corresponding path program 1 times [2018-11-06 21:06:55,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:55,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:55,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:56,191 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:06:56,540 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-11-06 21:06:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:56,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:56,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:06:56,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:06:56,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:06:56,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:06:56,615 INFO L87 Difference]: Start difference. First operand 22892 states and 25942 transitions. Second operand 5 states. [2018-11-06 21:06:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:58,641 INFO L93 Difference]: Finished difference Result 45078 states and 51350 transitions. [2018-11-06 21:06:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:06:58,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 256 [2018-11-06 21:06:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:58,683 INFO L225 Difference]: With dead ends: 45078 [2018-11-06 21:06:58,683 INFO L226 Difference]: Without dead ends: 25711 [2018-11-06 21:06:58,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:06:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25711 states. [2018-11-06 21:06:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25711 to 23643. [2018-11-06 21:06:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23643 states. [2018-11-06 21:06:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23643 states to 23643 states and 26570 transitions. [2018-11-06 21:06:59,005 INFO L78 Accepts]: Start accepts. Automaton has 23643 states and 26570 transitions. Word has length 256 [2018-11-06 21:06:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:59,006 INFO L480 AbstractCegarLoop]: Abstraction has 23643 states and 26570 transitions. [2018-11-06 21:06:59,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:06:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23643 states and 26570 transitions. [2018-11-06 21:06:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-06 21:06:59,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:59,015 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:06:59,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:59,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash 392874201, now seen corresponding path program 1 times [2018-11-06 21:06:59,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:59,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:59,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:06:59,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:06:59,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:06:59,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:06:59,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:06:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:06:59,458 INFO L87 Difference]: Start difference. First operand 23643 states and 26570 transitions. Second operand 4 states. [2018-11-06 21:07:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:07:01,331 INFO L93 Difference]: Finished difference Result 49695 states and 55875 transitions. [2018-11-06 21:07:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:07:01,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2018-11-06 21:07:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:07:01,373 INFO L225 Difference]: With dead ends: 49695 [2018-11-06 21:07:01,374 INFO L226 Difference]: Without dead ends: 24931 [2018-11-06 21:07:01,391 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:07:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24931 states. [2018-11-06 21:07:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24931 to 22882. [2018-11-06 21:07:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22882 states. [2018-11-06 21:07:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22882 states to 22882 states and 25414 transitions. [2018-11-06 21:07:01,667 INFO L78 Accepts]: Start accepts. Automaton has 22882 states and 25414 transitions. Word has length 272 [2018-11-06 21:07:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:07:01,668 INFO L480 AbstractCegarLoop]: Abstraction has 22882 states and 25414 transitions. [2018-11-06 21:07:01,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:07:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 22882 states and 25414 transitions. [2018-11-06 21:07:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-06 21:07:01,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:07:01,681 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:07:01,681 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:07:01,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:07:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash 100928380, now seen corresponding path program 1 times [2018-11-06 21:07:01,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:07:01,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:07:01,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:01,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:01,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:02,146 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:07:02,543 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-11-06 21:07:02,781 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-11-06 21:07:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 30 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:07:03,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:07:03,043 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:07:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:03,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:07:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-06 21:07:03,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:07:03,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 21:07:03,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:07:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:07:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:07:03,223 INFO L87 Difference]: Start difference. First operand 22882 states and 25414 transitions. Second operand 9 states. [2018-11-06 21:07:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:07:09,470 INFO L93 Difference]: Finished difference Result 56141 states and 62195 transitions. [2018-11-06 21:07:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:07:09,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2018-11-06 21:07:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:07:09,515 INFO L225 Difference]: With dead ends: 56141 [2018-11-06 21:07:09,516 INFO L226 Difference]: Without dead ends: 32884 [2018-11-06 21:07:09,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-11-06 21:07:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32884 states. [2018-11-06 21:07:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32884 to 19718. [2018-11-06 21:07:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19718 states. [2018-11-06 21:07:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19718 states to 19718 states and 21371 transitions. [2018-11-06 21:07:09,841 INFO L78 Accepts]: Start accepts. Automaton has 19718 states and 21371 transitions. Word has length 319 [2018-11-06 21:07:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:07:09,841 INFO L480 AbstractCegarLoop]: Abstraction has 19718 states and 21371 transitions. [2018-11-06 21:07:09,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:07:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19718 states and 21371 transitions. [2018-11-06 21:07:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-11-06 21:07:09,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:07:09,850 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:07:09,851 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:07:09,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:07:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 494519103, now seen corresponding path program 1 times [2018-11-06 21:07:09,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:07:09,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:07:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:09,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-06 21:07:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:07:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:07:10,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:07:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:07:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:07:10,275 INFO L87 Difference]: Start difference. First operand 19718 states and 21371 transitions. Second operand 4 states. [2018-11-06 21:07:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:07:12,109 INFO L93 Difference]: Finished difference Result 39268 states and 42486 transitions. [2018-11-06 21:07:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:07:12,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2018-11-06 21:07:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:07:12,131 INFO L225 Difference]: With dead ends: 39268 [2018-11-06 21:07:12,132 INFO L226 Difference]: Without dead ends: 20472 [2018-11-06 21:07:12,145 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:07:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20472 states. [2018-11-06 21:07:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20472 to 16746. [2018-11-06 21:07:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16746 states. [2018-11-06 21:07:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16746 states to 16746 states and 18045 transitions. [2018-11-06 21:07:12,397 INFO L78 Accepts]: Start accepts. Automaton has 16746 states and 18045 transitions. Word has length 322 [2018-11-06 21:07:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:07:12,398 INFO L480 AbstractCegarLoop]: Abstraction has 16746 states and 18045 transitions. [2018-11-06 21:07:12,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:07:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 16746 states and 18045 transitions. [2018-11-06 21:07:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-11-06 21:07:12,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:07:12,417 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:12,417 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:07:12,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:07:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash -537643111, now seen corresponding path program 1 times [2018-11-06 21:07:12,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:07:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:07:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:13,106 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:07:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 104 proven. 181 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:07:13,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:07:13,524 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:07:13,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:07:13,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:07:14,152 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2018-11-06 21:07:14,885 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 40 [2018-11-06 21:07:15,345 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2018-11-06 21:07:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 97 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:07:16,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:07:16,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:07:16,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:07:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:07:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:07:16,156 INFO L87 Difference]: Start difference. First operand 16746 states and 18045 transitions. Second operand 9 states. [2018-11-06 21:07:48,952 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-11-06 21:07:54,508 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-06 21:07:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:07:59,521 INFO L93 Difference]: Finished difference Result 41106 states and 44168 transitions. [2018-11-06 21:07:59,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-06 21:07:59,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 349 [2018-11-06 21:07:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:07:59,543 INFO L225 Difference]: With dead ends: 41106 [2018-11-06 21:07:59,543 INFO L226 Difference]: Without dead ends: 21939 [2018-11-06 21:07:59,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-11-06 21:07:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21939 states. [2018-11-06 21:07:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21939 to 15999. [2018-11-06 21:07:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15999 states. [2018-11-06 21:07:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15999 states to 15999 states and 17085 transitions. [2018-11-06 21:07:59,762 INFO L78 Accepts]: Start accepts. Automaton has 15999 states and 17085 transitions. Word has length 349 [2018-11-06 21:07:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:07:59,763 INFO L480 AbstractCegarLoop]: Abstraction has 15999 states and 17085 transitions. [2018-11-06 21:07:59,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:07:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 15999 states and 17085 transitions. [2018-11-06 21:07:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-11-06 21:07:59,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:07:59,774 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:07:59,774 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:07:59,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:07:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash -175707184, now seen corresponding path program 1 times [2018-11-06 21:07:59,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:07:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:07:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:59,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:07:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:07:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:00,311 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:08:00,882 WARN L179 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-06 21:08:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 194 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:08:01,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:08:01,734 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:08:01,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:01,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:08:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 203 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:08:02,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:08:02,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-06 21:08:02,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:08:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:08:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:08:02,621 INFO L87 Difference]: Start difference. First operand 15999 states and 17085 transitions. Second operand 12 states. [2018-11-06 21:08:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:10,322 INFO L93 Difference]: Finished difference Result 29445 states and 31293 transitions. [2018-11-06 21:08:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 21:08:10,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 391 [2018-11-06 21:08:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:10,335 INFO L225 Difference]: With dead ends: 29445 [2018-11-06 21:08:10,336 INFO L226 Difference]: Without dead ends: 14925 [2018-11-06 21:08:10,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2018-11-06 21:08:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14925 states. [2018-11-06 21:08:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14925 to 11145. [2018-11-06 21:08:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11145 states. [2018-11-06 21:08:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 11733 transitions. [2018-11-06 21:08:10,470 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 11733 transitions. Word has length 391 [2018-11-06 21:08:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:10,470 INFO L480 AbstractCegarLoop]: Abstraction has 11145 states and 11733 transitions. [2018-11-06 21:08:10,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:08:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 11733 transitions. [2018-11-06 21:08:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-11-06 21:08:10,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:10,481 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:08:10,481 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:10,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash -115186598, now seen corresponding path program 1 times [2018-11-06 21:08:10,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 126 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:08:11,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:08:11,214 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:08:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:11,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:08:11,861 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2018-11-06 21:08:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 195 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:08:13,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:08:13,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:08:13,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:08:13,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:08:13,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:08:13,251 INFO L87 Difference]: Start difference. First operand 11145 states and 11733 transitions. Second operand 10 states. [2018-11-06 21:08:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:20,869 INFO L93 Difference]: Finished difference Result 21743 states and 22891 transitions. [2018-11-06 21:08:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:08:20,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 435 [2018-11-06 21:08:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:20,882 INFO L225 Difference]: With dead ends: 21743 [2018-11-06 21:08:20,882 INFO L226 Difference]: Without dead ends: 12268 [2018-11-06 21:08:20,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:08:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12268 states. [2018-11-06 21:08:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12268 to 10775. [2018-11-06 21:08:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10775 states. [2018-11-06 21:08:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10775 states to 10775 states and 11193 transitions. [2018-11-06 21:08:21,026 INFO L78 Accepts]: Start accepts. Automaton has 10775 states and 11193 transitions. Word has length 435 [2018-11-06 21:08:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:21,027 INFO L480 AbstractCegarLoop]: Abstraction has 10775 states and 11193 transitions. [2018-11-06 21:08:21,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:08:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 10775 states and 11193 transitions. [2018-11-06 21:08:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2018-11-06 21:08:21,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:08:21,044 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, 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:08:21,044 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:08:21,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:08:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1704267376, now seen corresponding path program 1 times [2018-11-06 21:08:21,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:08:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:08:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:21,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:08:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 672 proven. 549 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:08:22,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:08:22,351 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:08:22,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:08:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:08:22,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:08:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 777 proven. 444 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:08:24,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:08:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-06 21:08:24,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:08:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:08:24,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:08:24,553 INFO L87 Difference]: Start difference. First operand 10775 states and 11193 transitions. Second operand 11 states. [2018-11-06 21:08:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:08:31,493 INFO L93 Difference]: Finished difference Result 18213 states and 18962 transitions. [2018-11-06 21:08:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:08:31,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 721 [2018-11-06 21:08:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:08:31,494 INFO L225 Difference]: With dead ends: 18213 [2018-11-06 21:08:31,494 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:08:31,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-06 21:08:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:08:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:08:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:08:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:08:31,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 721 [2018-11-06 21:08:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:08:31,502 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:08:31,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:08:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:08:31,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:08:31,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:08:31,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:31,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:32,997 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 759 DAG size of output: 521 [2018-11-06 21:08:33,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:33,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:34,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:34,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:34,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:08:34,239 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 759 DAG size of output: 521 [2018-11-06 21:08:39,511 WARN L179 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 477 DAG size of output: 150 [2018-11-06 21:08:44,230 WARN L179 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 477 DAG size of output: 150 [2018-11-06 21:08:44,233 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,234 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,235 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,236 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:08:44,237 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse17 (= ~a25~0 10)) (.cse28 (+ ~a23~0 43)) (.cse25 (= ~a25~0 13))) (let ((.cse14 (<= ~a29~0 130)) (.cse11 (<= (+ ~a29~0 275923) 0)) (.cse2 (< 277 ~a29~0)) (.cse10 (<= ~a4~0 0)) (.cse19 (not .cse25)) (.cse12 (<= ~a29~0 599998)) (.cse6 (< 0 .cse28)) (.cse24 (not .cse17)) (.cse27 (<= ~a25~0 12)) (.cse8 (<= ~a29~0 245)) (.cse18 (= ~a4~0 1)) (.cse21 (< 306 ~a23~0)) (.cse20 (exists ((v_prenex_35 Int)) (let ((.cse29 (+ v_prenex_35 69157))) (and (<= ~a29~0 (+ (mod .cse29 299861) 300138)) (<= 130 v_prenex_35) (<= 0 .cse29))))) (.cse26 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499)))) (.cse9 (= ~a25~0 12)) (.cse23 (<= .cse28 0)) (.cse7 (<= ~a23~0 306)) (.cse15 (<= 130 ~a29~0)) (.cse13 (= ~a25~0 11)) (.cse0 (= ~a8~0 15)) (.cse3 (exists ((v_~a29~0_510 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_510 299861) 300139)) (<= 0 v_~a29~0_510) (< 277 v_~a29~0_510)))) (.cse1 (= ~a25~0 9)) (.cse22 (< 140 ~a29~0)) (.cse16 (<= 312 ~a23~0)) (.cse4 (= 1 ~a4~0)) (.cse5 (= ~a3~0 1))) (or (and .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse10 .cse11 .cse5) (and .cse0 .cse12 .cse7 .cse13 .cse5) (and (<= ~a23~0 312) .cse1 .cse14 .cse4 .cse15 .cse16) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= (+ ~a29~0 22) 0) .cse5 (and .cse9 .cse7)) (and .cse0 .cse14 .cse17 .cse5) (and .cse9 (and .cse0 (and .cse16 .cse18) .cse5) .cse11) (and .cse1 .cse7 .cse4) (and (and .cse0 .cse7 .cse19 .cse5) .cse11) (and (<= (+ ~a23~0 599772) 0) .cse4 .cse17) (and .cse9 .cse0 .cse20 (and .cse21 .cse22 .cse18) .cse5) (and .cse18 .cse7 .cse17 .cse2) (and (and .cse0 .cse21 .cse17 .cse5) .cse3 .cse4) (and (or (and .cse9 .cse0 .cse22 .cse5 .cse23) (and .cse0 .cse10 .cse22 .cse9 .cse5)) .cse12) (and .cse7 .cse4 .cse13) (and .cse7 .cse8 .cse4 .cse15) (and .cse0 .cse19 .cse12 (exists ((v_prenex_34 Int)) (and (<= (+ (mod v_prenex_34 299861) 10250) ~a29~0) (<= 0 v_prenex_34) (< 140 v_prenex_34))) (not .cse4) .cse5 .cse23 .cse24) (and .cse25 (and .cse6 .cse7) .cse4) (and .cse26 .cse7 .cse27 .cse4 .cse24) (and .cse7 .cse27 .cse8 .cse4) (and .cse0 .cse18 .cse17 .cse5 .cse23) (and (and .cse0 .cse21) .cse25 .cse20 .cse4 .cse5) (and .cse0 (and .cse1 .cse22 .cse26 .cse4) .cse5) (and .cse1 (and (<= (+ ~a29~0 275804) 0) .cse4)) (and .cse9 .cse0 .cse4 .cse5 .cse23) (and .cse25 .cse7 .cse4 .cse15) (and (and .cse0 .cse22) .cse3 .cse4 .cse13 .cse5) (and .cse0 .cse3 (and .cse1 .cse22 .cse16) .cse4 .cse5)))) [2018-11-06 21:08:44,237 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,237 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,237 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,237 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,237 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,238 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,239 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,240 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,241 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:08:44,242 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,243 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,244 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,245 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,246 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,247 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:08:44,248 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:08:44,249 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:08:44,250 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:08:44,251 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,252 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,253 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,254 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,255 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse17 (= ~a25~0 10)) (.cse28 (+ ~a23~0 43)) (.cse25 (= ~a25~0 13))) (let ((.cse14 (<= ~a29~0 130)) (.cse11 (<= (+ ~a29~0 275923) 0)) (.cse2 (< 277 ~a29~0)) (.cse10 (<= ~a4~0 0)) (.cse19 (not .cse25)) (.cse12 (<= ~a29~0 599998)) (.cse6 (< 0 .cse28)) (.cse24 (not .cse17)) (.cse27 (<= ~a25~0 12)) (.cse8 (<= ~a29~0 245)) (.cse18 (= ~a4~0 1)) (.cse21 (< 306 ~a23~0)) (.cse20 (exists ((v_prenex_35 Int)) (let ((.cse29 (+ v_prenex_35 69157))) (and (<= ~a29~0 (+ (mod .cse29 299861) 300138)) (<= 130 v_prenex_35) (<= 0 .cse29))))) (.cse26 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499)))) (.cse9 (= ~a25~0 12)) (.cse23 (<= .cse28 0)) (.cse7 (<= ~a23~0 306)) (.cse15 (<= 130 ~a29~0)) (.cse13 (= ~a25~0 11)) (.cse0 (= ~a8~0 15)) (.cse3 (exists ((v_~a29~0_510 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_510 299861) 300139)) (<= 0 v_~a29~0_510) (< 277 v_~a29~0_510)))) (.cse1 (= ~a25~0 9)) (.cse22 (< 140 ~a29~0)) (.cse16 (<= 312 ~a23~0)) (.cse4 (= 1 ~a4~0)) (.cse5 (= ~a3~0 1))) (or (and .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse10 .cse11 .cse5) (and .cse0 .cse12 .cse7 .cse13 .cse5) (and (<= ~a23~0 312) .cse1 .cse14 .cse4 .cse15 .cse16) (and .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input)) (<= (+ ~a29~0 22) 0) .cse5 (and .cse9 .cse7)) (and .cse0 .cse14 .cse17 .cse5) (and .cse9 (and .cse0 (and .cse16 .cse18) .cse5) .cse11) (and .cse1 .cse7 .cse4) (and (and .cse0 .cse7 .cse19 .cse5) .cse11) (and (<= (+ ~a23~0 599772) 0) .cse4 .cse17) (and .cse9 .cse0 .cse20 (and .cse21 .cse22 .cse18) .cse5) (and .cse18 .cse7 .cse17 .cse2) (and (and .cse0 .cse21 .cse17 .cse5) .cse3 .cse4) (and (or (and .cse9 .cse0 .cse22 .cse5 .cse23) (and .cse0 .cse10 .cse22 .cse9 .cse5)) .cse12) (and .cse7 .cse4 .cse13) (and .cse7 .cse8 .cse4 .cse15) (and .cse0 .cse19 .cse12 (exists ((v_prenex_34 Int)) (and (<= (+ (mod v_prenex_34 299861) 10250) ~a29~0) (<= 0 v_prenex_34) (< 140 v_prenex_34))) (not .cse4) .cse5 .cse23 .cse24) (and .cse25 (and .cse6 .cse7) .cse4) (and .cse26 .cse7 .cse27 .cse4 .cse24) (and .cse7 .cse27 .cse8 .cse4) (and .cse0 .cse18 .cse17 .cse5 .cse23) (and (and .cse0 .cse21) .cse25 .cse20 .cse4 .cse5) (and .cse0 (and .cse1 .cse22 .cse26 .cse4) .cse5) (and .cse1 (and (<= (+ ~a29~0 275804) 0) .cse4)) (and .cse9 .cse0 .cse4 .cse5 .cse23) (and .cse25 .cse7 .cse4 .cse15) (and (and .cse0 .cse22) .cse3 .cse4 .cse13 .cse5) (and .cse0 .cse3 (and .cse1 .cse22 .cse16) .cse4 .cse5)))) [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,256 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:08:44,257 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,257 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,257 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:08:44,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,300 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,301 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,302 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:08:44 BoogieIcfgContainer [2018-11-06 21:08:44,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:08:44,320 INFO L168 Benchmark]: Toolchain (without parser) took 152715.80 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -878.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:08:44,322 INFO L168 Benchmark]: CDTParser took 0.24 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:08:44,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1053.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:44,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 285.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:44,324 INFO L168 Benchmark]: Boogie Preprocessor took 127.51 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:44,325 INFO L168 Benchmark]: RCFGBuilder took 4985.04 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 189.8 MB). Peak memory consumption was 189.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:08:44,325 INFO L168 Benchmark]: TraceAbstraction took 146259.09 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -331.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 21:08:44,331 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1053.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 285.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.51 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4985.04 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 189.8 MB). Peak memory consumption was 189.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146259.09 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -331.3 MB). Peak memory consumption was 2.1 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_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 114]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-11-06 21:08:44,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,354 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,354 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,356 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,356 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,356 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,356 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,357 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,357 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,357 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,357 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a8 == 15 && a25 == 9 && 277 < a29) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && 1 == a4) && a3 == 1) || ((((a8 == 15 && 0 < a23 + 43) && a23 <= 306) && a29 <= 245) && a3 == 1)) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && a29 + 275923 <= 0) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && a23 <= 306) && a25 == 11) && a3 == 1)) || (((((a23 <= 312 && a25 == 9) && a29 <= 130) && 1 == a4) && 130 <= a29) && 312 <= a23)) || ((((a8 == 15 && !(3 == input)) && a29 + 22 <= 0) && a3 == 1) && a25 == 12 && a23 <= 306)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || ((a25 == 12 && (a8 == 15 && 312 <= a23 && a4 == 1) && a3 == 1) && a29 + 275923 <= 0)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || ((((a8 == 15 && a23 <= 306) && !(a25 == 13)) && a3 == 1) && a29 + 275923 <= 0)) || ((a23 + 599772 <= 0 && 1 == a4) && a25 == 10)) || ((((a25 == 12 && a8 == 15) && (\exists v_prenex_35 : int :: (a29 <= (v_prenex_35 + 69157) % 299861 + 300138 && 130 <= v_prenex_35) && 0 <= v_prenex_35 + 69157)) && (306 < a23 && 140 < a29) && a4 == 1) && a3 == 1)) || (((a4 == 1 && a23 <= 306) && a25 == 10) && 277 < a29)) || (((((a8 == 15 && 306 < a23) && a25 == 10) && a3 == 1) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && 140 < a29) && a3 == 1) && a23 + 43 <= 0) || ((((a8 == 15 && a4 <= 0) && 140 < a29) && a25 == 12) && a3 == 1)) && a29 <= 599998)) || ((a23 <= 306 && 1 == a4) && a25 == 11)) || (((a23 <= 306 && a29 <= 245) && 1 == a4) && 130 <= a29)) || (((((((a8 == 15 && !(a25 == 13)) && a29 <= 599998) && (\exists v_prenex_34 : int :: (v_prenex_34 % 299861 + 10250 <= a29 && 0 <= v_prenex_34) && 140 < v_prenex_34)) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && 0 < a23 + 43 && a23 <= 306) && 1 == a4)) || (((((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a23 <= 306) && a25 <= 12) && 1 == a4) && !(a25 == 10))) || (((a23 <= 306 && a25 <= 12) && a29 <= 245) && 1 == a4)) || ((((a8 == 15 && a4 == 1) && a25 == 10) && a3 == 1) && a23 + 43 <= 0)) || (((((a8 == 15 && 306 < a23) && a25 == 13) && (\exists v_prenex_35 : int :: (a29 <= (v_prenex_35 + 69157) % 299861 + 300138 && 130 <= v_prenex_35) && 0 <= v_prenex_35 + 69157)) && 1 == a4) && a3 == 1)) || ((a8 == 15 && ((a25 == 9 && 140 < a29) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && 1 == a4) && a3 == 1)) || (a25 == 9 && a29 + 275804 <= 0 && 1 == a4)) || ((((a25 == 12 && a8 == 15) && 1 == a4) && a3 == 1) && a23 + 43 <= 0)) || (((a25 == 13 && a23 <= 306) && 1 == a4) && 130 <= a29)) || (((((a8 == 15 && 140 < a29) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && 1 == a4) && a25 == 11) && a3 == 1)) || ((((a8 == 15 && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && (a25 == 9 && 140 < a29) && 312 <= a23) && 1 == a4) && a3 == 1) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:08:44,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,362 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,362 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,368 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:08:44,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_35,QUANTIFIED] [2018-11-06 21:08:44,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:08:44,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:08:44,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a8 == 15 && a25 == 9 && 277 < a29) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && 1 == a4) && a3 == 1) || ((((a8 == 15 && 0 < a23 + 43) && a23 <= 306) && a29 <= 245) && a3 == 1)) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && a29 + 275923 <= 0) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && a23 <= 306) && a25 == 11) && a3 == 1)) || (((((a23 <= 312 && a25 == 9) && a29 <= 130) && 1 == a4) && 130 <= a29) && 312 <= a23)) || ((((a8 == 15 && !(3 == input)) && a29 + 22 <= 0) && a3 == 1) && a25 == 12 && a23 <= 306)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || ((a25 == 12 && (a8 == 15 && 312 <= a23 && a4 == 1) && a3 == 1) && a29 + 275923 <= 0)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || ((((a8 == 15 && a23 <= 306) && !(a25 == 13)) && a3 == 1) && a29 + 275923 <= 0)) || ((a23 + 599772 <= 0 && 1 == a4) && a25 == 10)) || ((((a25 == 12 && a8 == 15) && (\exists v_prenex_35 : int :: (a29 <= (v_prenex_35 + 69157) % 299861 + 300138 && 130 <= v_prenex_35) && 0 <= v_prenex_35 + 69157)) && (306 < a23 && 140 < a29) && a4 == 1) && a3 == 1)) || (((a4 == 1 && a23 <= 306) && a25 == 10) && 277 < a29)) || (((((a8 == 15 && 306 < a23) && a25 == 10) && a3 == 1) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && 140 < a29) && a3 == 1) && a23 + 43 <= 0) || ((((a8 == 15 && a4 <= 0) && 140 < a29) && a25 == 12) && a3 == 1)) && a29 <= 599998)) || ((a23 <= 306 && 1 == a4) && a25 == 11)) || (((a23 <= 306 && a29 <= 245) && 1 == a4) && 130 <= a29)) || (((((((a8 == 15 && !(a25 == 13)) && a29 <= 599998) && (\exists v_prenex_34 : int :: (v_prenex_34 % 299861 + 10250 <= a29 && 0 <= v_prenex_34) && 140 < v_prenex_34)) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && 0 < a23 + 43 && a23 <= 306) && 1 == a4)) || (((((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a23 <= 306) && a25 <= 12) && 1 == a4) && !(a25 == 10))) || (((a23 <= 306 && a25 <= 12) && a29 <= 245) && 1 == a4)) || ((((a8 == 15 && a4 == 1) && a25 == 10) && a3 == 1) && a23 + 43 <= 0)) || (((((a8 == 15 && 306 < a23) && a25 == 13) && (\exists v_prenex_35 : int :: (a29 <= (v_prenex_35 + 69157) % 299861 + 300138 && 130 <= v_prenex_35) && 0 <= v_prenex_35 + 69157)) && 1 == a4) && a3 == 1)) || ((a8 == 15 && ((a25 == 9 && 140 < a29) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && 1 == a4) && a3 == 1)) || (a25 == 9 && a29 + 275804 <= 0 && 1 == a4)) || ((((a25 == 12 && a8 == 15) && 1 == a4) && a3 == 1) && a23 + 43 <= 0)) || (((a25 == 13 && a23 <= 306) && 1 == a4) && 130 <= a29)) || (((((a8 == 15 && 140 < a29) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && 1 == a4) && a25 == 11) && a3 == 1)) || ((((a8 == 15 && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && (a25 == 9 && 140 < a29) && 312 <= a23) && 1 == a4) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 146.1s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 110.3s AutomataDifference, 0.0s DeadEndRemovalTime, 12.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2312 SDtfs, 16722 SDslu, 2379 SDs, 0 SdLazy, 46603 SolverSat, 5967 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 92.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2611 GetRequests, 2479 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23643occurred in iteration=7, 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.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 36005 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 296 NumberOfFragments, 1297 HoareAnnotationTreeSize, 3 FomulaSimplifications, 86110 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 29866 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 6473 NumberOfCodeBlocks, 6473 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 6453 ConstructedInterpolants, 914 QuantifiedInterpolants, 22101959 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3207 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 4001/6753 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...