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_label10_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:02:06,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:02:06,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:02:06,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:02:06,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:02:06,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:02:06,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:02:06,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:02:06,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:02:06,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:02:06,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:02:06,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:02:06,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:02:06,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:02:06,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:02:06,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:02:06,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:02:06,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:02:06,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:02:06,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:02:06,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:02:06,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:02:06,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:02:06,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:02:06,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:02:06,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:02:06,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:02:06,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:02:06,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:02:06,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:02:06,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:02:06,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:02:06,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:02:06,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:02:06,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:02:06,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:02:06,145 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:02:06,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:02:06,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:02:06,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:02:06,162 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:02:06,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:02:06,163 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:02:06,163 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:02:06,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:02:06,163 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:02:06,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:02:06,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:02:06,164 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:02:06,164 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:02:06,164 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:02:06,164 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:02:06,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:02:06,165 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:02:06,165 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:02:06,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:02:06,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:02:06,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:02:06,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:02:06,166 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:02:06,166 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:02:06,166 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:02:06,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:02:06,167 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:02:06,167 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:02:06,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:02:06,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:02:06,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:02:06,228 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:02:06,228 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:02:06,229 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label10_true-unreach-call.c [2018-11-06 21:02:06,287 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2780d7a/fcb4a2a6605647bda74437df8654e277/FLAG53605f6b4 [2018-11-06 21:02:06,898 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:02:06,901 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label10_true-unreach-call.c [2018-11-06 21:02:06,919 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2780d7a/fcb4a2a6605647bda74437df8654e277/FLAG53605f6b4 [2018-11-06 21:02:06,940 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2780d7a/fcb4a2a6605647bda74437df8654e277 [2018-11-06 21:02:06,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:02:06,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:02:06,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:06,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:02:06,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:02:06,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:06" (1/1) ... [2018-11-06 21:02:06,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781e5000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:06, skipping insertion in model container [2018-11-06 21:02:06,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:06" (1/1) ... [2018-11-06 21:02:06,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:02:07,062 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:02:07,696 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:07,701 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:02:07,873 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:07,904 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:02:07,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07 WrapperNode [2018-11-06 21:02:07,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:07,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:07,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:02:07,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:02:07,920 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:02:07" (1/1) ... [2018-11-06 21:02:08,063 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:02:07" (1/1) ... [2018-11-06 21:02:08,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:08,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:02:08,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:02:08,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:02:08,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (1/1) ... [2018-11-06 21:02:08,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:02:08,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:02:08,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:02:08,344 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:02:08,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (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:02:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:02:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:02:08,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:02:12,819 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:02:12,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:12 BoogieIcfgContainer [2018-11-06 21:02:12,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:02:12,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:02:12,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:02:12,824 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:02:12,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:02:06" (1/3) ... [2018-11-06 21:02:12,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6326f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:12, skipping insertion in model container [2018-11-06 21:02:12,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:07" (2/3) ... [2018-11-06 21:02:12,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6326f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:12, skipping insertion in model container [2018-11-06 21:02:12,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:12" (3/3) ... [2018-11-06 21:02:12,828 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label10_true-unreach-call.c [2018-11-06 21:02:12,838 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:02:12,847 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:02:12,866 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:02:12,903 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:02:12,904 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:02:12,904 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:02:12,904 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:02:12,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:02:12,905 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:02:12,905 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:02:12,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:02:12,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:02:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:02:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-06 21:02:12,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:12,956 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] [2018-11-06 21:02:12,958 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:12,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:12,963 INFO L82 PathProgramCache]: Analyzing trace with hash -314381782, now seen corresponding path program 1 times [2018-11-06 21:02:12,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:13,399 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 21:02:13,410 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:02:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:13,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:13,438 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:02:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:16,804 INFO L93 Difference]: Finished difference Result 977 states and 1747 transitions. [2018-11-06 21:02:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:16,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-06 21:02:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:16,831 INFO L225 Difference]: With dead ends: 977 [2018-11-06 21:02:16,831 INFO L226 Difference]: Without dead ends: 686 [2018-11-06 21:02:16,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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:02:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-06 21:02:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 683. [2018-11-06 21:02:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-11-06 21:02:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1060 transitions. [2018-11-06 21:02:16,933 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1060 transitions. Word has length 23 [2018-11-06 21:02:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:16,933 INFO L480 AbstractCegarLoop]: Abstraction has 683 states and 1060 transitions. [2018-11-06 21:02:16,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1060 transitions. [2018-11-06 21:02:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-06 21:02:16,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:16,938 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:16,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:16,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 487547954, now seen corresponding path program 1 times [2018-11-06 21:02:16,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:16,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:17,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:17,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:17,204 INFO L87 Difference]: Start difference. First operand 683 states and 1060 transitions. Second operand 4 states. [2018-11-06 21:02:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:21,556 INFO L93 Difference]: Finished difference Result 2492 states and 3982 transitions. [2018-11-06 21:02:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:21,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-06 21:02:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:21,567 INFO L225 Difference]: With dead ends: 2492 [2018-11-06 21:02:21,568 INFO L226 Difference]: Without dead ends: 1811 [2018-11-06 21:02:21,572 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:02:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-06 21:02:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1795. [2018-11-06 21:02:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-11-06 21:02:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2640 transitions. [2018-11-06 21:02:21,646 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2640 transitions. Word has length 92 [2018-11-06 21:02:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:21,647 INFO L480 AbstractCegarLoop]: Abstraction has 1795 states and 2640 transitions. [2018-11-06 21:02:21,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2640 transitions. [2018-11-06 21:02:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-06 21:02:21,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:21,651 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:21,652 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:21,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:21,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2043482925, now seen corresponding path program 1 times [2018-11-06 21:02:21,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:21,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:21,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:22,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:22,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:22,008 INFO L87 Difference]: Start difference. First operand 1795 states and 2640 transitions. Second operand 4 states. [2018-11-06 21:02:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:24,860 INFO L93 Difference]: Finished difference Result 6742 states and 10027 transitions. [2018-11-06 21:02:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:24,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-11-06 21:02:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:24,887 INFO L225 Difference]: With dead ends: 6742 [2018-11-06 21:02:24,888 INFO L226 Difference]: Without dead ends: 4949 [2018-11-06 21:02:24,892 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:02:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2018-11-06 21:02:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4949. [2018-11-06 21:02:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2018-11-06 21:02:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 6496 transitions. [2018-11-06 21:02:24,995 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 6496 transitions. Word has length 118 [2018-11-06 21:02:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:24,996 INFO L480 AbstractCegarLoop]: Abstraction has 4949 states and 6496 transitions. [2018-11-06 21:02:24,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 6496 transitions. [2018-11-06 21:02:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-06 21:02:25,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:25,003 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:25,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:25,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1055735476, now seen corresponding path program 1 times [2018-11-06 21:02:25,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:25,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:25,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:25,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:25,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:25,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:25,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:25,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:25,359 INFO L87 Difference]: Start difference. First operand 4949 states and 6496 transitions. Second operand 4 states. [2018-11-06 21:02:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:29,525 INFO L93 Difference]: Finished difference Result 13991 states and 18823 transitions. [2018-11-06 21:02:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:29,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-06 21:02:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:29,563 INFO L225 Difference]: With dead ends: 13991 [2018-11-06 21:02:29,564 INFO L226 Difference]: Without dead ends: 9229 [2018-11-06 21:02:29,570 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:02:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9229 states. [2018-11-06 21:02:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9229 to 6981. [2018-11-06 21:02:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2018-11-06 21:02:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 8740 transitions. [2018-11-06 21:02:29,690 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 8740 transitions. Word has length 151 [2018-11-06 21:02:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:29,691 INFO L480 AbstractCegarLoop]: Abstraction has 6981 states and 8740 transitions. [2018-11-06 21:02:29,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 8740 transitions. [2018-11-06 21:02:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-06 21:02:29,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:29,697 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:29,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:29,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:29,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1905687981, now seen corresponding path program 1 times [2018-11-06 21:02:29,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:29,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-06 21:02:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:30,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:30,192 INFO L87 Difference]: Start difference. First operand 6981 states and 8740 transitions. Second operand 4 states. [2018-11-06 21:02:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:32,776 INFO L93 Difference]: Finished difference Result 16015 states and 20274 transitions. [2018-11-06 21:02:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:32,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2018-11-06 21:02:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:32,815 INFO L225 Difference]: With dead ends: 16015 [2018-11-06 21:02:32,815 INFO L226 Difference]: Without dead ends: 9221 [2018-11-06 21:02:32,825 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:02:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2018-11-06 21:02:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 9201. [2018-11-06 21:02:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9201 states. [2018-11-06 21:02:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9201 states to 9201 states and 11261 transitions. [2018-11-06 21:02:32,958 INFO L78 Accepts]: Start accepts. Automaton has 9201 states and 11261 transitions. Word has length 229 [2018-11-06 21:02:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:32,959 INFO L480 AbstractCegarLoop]: Abstraction has 9201 states and 11261 transitions. [2018-11-06 21:02:32,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9201 states and 11261 transitions. [2018-11-06 21:02:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-06 21:02:32,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:32,965 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:32,965 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:32,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1116672364, now seen corresponding path program 1 times [2018-11-06 21:02:32,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:32,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:32,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:32,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:32,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 90 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:33,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:33,326 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:02:33,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:33,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:33,894 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2018-11-06 21:02:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 41 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-11-06 21:02:34,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:02:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:02:34,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:02:34,422 INFO L87 Difference]: Start difference. First operand 9201 states and 11261 transitions. Second operand 8 states. [2018-11-06 21:02:34,756 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2018-11-06 21:02:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:45,439 INFO L93 Difference]: Finished difference Result 28657 states and 35384 transitions. [2018-11-06 21:02:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:02:45,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 237 [2018-11-06 21:02:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:45,487 INFO L225 Difference]: With dead ends: 28657 [2018-11-06 21:02:45,487 INFO L226 Difference]: Without dead ends: 18335 [2018-11-06 21:02:45,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-06 21:02:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18335 states. [2018-11-06 21:02:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18335 to 15899. [2018-11-06 21:02:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15899 states. [2018-11-06 21:02:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15899 states to 15899 states and 18496 transitions. [2018-11-06 21:02:45,856 INFO L78 Accepts]: Start accepts. Automaton has 15899 states and 18496 transitions. Word has length 237 [2018-11-06 21:02:45,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:45,857 INFO L480 AbstractCegarLoop]: Abstraction has 15899 states and 18496 transitions. [2018-11-06 21:02:45,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:02:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 15899 states and 18496 transitions. [2018-11-06 21:02:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-06 21:02:45,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:45,863 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,864 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:45,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash -470884986, now seen corresponding path program 1 times [2018-11-06 21:02:45,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:45,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:45,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:46,329 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:02:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:46,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:46,925 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:02:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:47,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:47,360 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:02:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 75 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:47,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:47,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-11-06 21:02:47,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:02:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:02:47,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:02:47,668 INFO L87 Difference]: Start difference. First operand 15899 states and 18496 transitions. Second operand 11 states. [2018-11-06 21:02:51,985 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:02:54,499 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-06 21:02:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:58,395 INFO L93 Difference]: Finished difference Result 45734 states and 53551 transitions. [2018-11-06 21:02:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-06 21:02:58,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 239 [2018-11-06 21:02:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:58,457 INFO L225 Difference]: With dead ends: 45734 [2018-11-06 21:02:58,457 INFO L226 Difference]: Without dead ends: 30207 [2018-11-06 21:02:58,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2018-11-06 21:02:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2018-11-06 21:02:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 23282. [2018-11-06 21:02:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23282 states. [2018-11-06 21:02:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23282 states to 23282 states and 26180 transitions. [2018-11-06 21:02:58,839 INFO L78 Accepts]: Start accepts. Automaton has 23282 states and 26180 transitions. Word has length 239 [2018-11-06 21:02:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:58,840 INFO L480 AbstractCegarLoop]: Abstraction has 23282 states and 26180 transitions. [2018-11-06 21:02:58,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:02:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23282 states and 26180 transitions. [2018-11-06 21:02:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-06 21:02:58,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:58,846 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:58,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:58,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 847309857, now seen corresponding path program 1 times [2018-11-06 21:02:58,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:58,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:58,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:59,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:59,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:59,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:59,284 INFO L87 Difference]: Start difference. First operand 23282 states and 26180 transitions. Second operand 4 states. [2018-11-06 21:03:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:01,335 INFO L93 Difference]: Finished difference Result 46750 states and 52559 transitions. [2018-11-06 21:03:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:01,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-11-06 21:03:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:01,366 INFO L225 Difference]: With dead ends: 46750 [2018-11-06 21:03:01,366 INFO L226 Difference]: Without dead ends: 23840 [2018-11-06 21:03:01,388 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:03:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23840 states. [2018-11-06 21:03:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23840 to 21793. [2018-11-06 21:03:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21793 states. [2018-11-06 21:03:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21793 states to 21793 states and 24382 transitions. [2018-11-06 21:03:01,966 INFO L78 Accepts]: Start accepts. Automaton has 21793 states and 24382 transitions. Word has length 258 [2018-11-06 21:03:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:01,967 INFO L480 AbstractCegarLoop]: Abstraction has 21793 states and 24382 transitions. [2018-11-06 21:03:01,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21793 states and 24382 transitions. [2018-11-06 21:03:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-06 21:03:01,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:01,977 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:01,978 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:01,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1177107993, now seen corresponding path program 1 times [2018-11-06 21:03:01,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:01,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:02,444 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:03:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-06 21:03:02,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:02,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:02,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:02,486 INFO L87 Difference]: Start difference. First operand 21793 states and 24382 transitions. Second operand 4 states. [2018-11-06 21:03:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:04,209 INFO L93 Difference]: Finished difference Result 43233 states and 48389 transitions. [2018-11-06 21:03:04,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:04,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-11-06 21:03:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:04,231 INFO L225 Difference]: With dead ends: 43233 [2018-11-06 21:03:04,231 INFO L226 Difference]: Without dead ends: 21812 [2018-11-06 21:03:04,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21812 states. [2018-11-06 21:03:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21812 to 19750. [2018-11-06 21:03:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19750 states. [2018-11-06 21:03:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19750 states to 19750 states and 21771 transitions. [2018-11-06 21:03:04,504 INFO L78 Accepts]: Start accepts. Automaton has 19750 states and 21771 transitions. Word has length 308 [2018-11-06 21:03:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:04,505 INFO L480 AbstractCegarLoop]: Abstraction has 19750 states and 21771 transitions. [2018-11-06 21:03:04,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 19750 states and 21771 transitions. [2018-11-06 21:03:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-06 21:03:04,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:04,519 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:04,520 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:04,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -882791487, now seen corresponding path program 1 times [2018-11-06 21:03:04,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:05,164 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:03:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 62 proven. 181 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:03:05,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:05,289 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:03:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:05,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 97 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:03:06,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:03:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:03:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:03:06,799 INFO L87 Difference]: Start difference. First operand 19750 states and 21771 transitions. Second operand 9 states. [2018-11-06 21:03:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:33,427 INFO L93 Difference]: Finished difference Result 50654 states and 56086 transitions. [2018-11-06 21:03:33,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-06 21:03:33,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 335 [2018-11-06 21:03:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:33,469 INFO L225 Difference]: With dead ends: 50654 [2018-11-06 21:03:33,469 INFO L226 Difference]: Without dead ends: 27544 [2018-11-06 21:03:33,486 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-11-06 21:03:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27544 states. [2018-11-06 21:03:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27544 to 20480. [2018-11-06 21:03:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20480 states. [2018-11-06 21:03:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20480 states to 20480 states and 22190 transitions. [2018-11-06 21:03:33,820 INFO L78 Accepts]: Start accepts. Automaton has 20480 states and 22190 transitions. Word has length 335 [2018-11-06 21:03:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:33,820 INFO L480 AbstractCegarLoop]: Abstraction has 20480 states and 22190 transitions. [2018-11-06 21:03:33,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:03:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20480 states and 22190 transitions. [2018-11-06 21:03:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-06 21:03:33,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:33,845 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:33,846 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:33,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1115860488, now seen corresponding path program 1 times [2018-11-06 21:03:33,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:33,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:33,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:33,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:34,393 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:03:34,959 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:03:35,804 WARN L179 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-06 21:03:36,450 WARN L179 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-11-06 21:03:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 152 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:37,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:37,326 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:03:37,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:37,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 161 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:38,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:38,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-06 21:03:38,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:03:38,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:03:38,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:03:38,195 INFO L87 Difference]: Start difference. First operand 20480 states and 22190 transitions. Second operand 12 states. [2018-11-06 21:03:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:48,008 INFO L93 Difference]: Finished difference Result 46081 states and 49798 transitions. [2018-11-06 21:03:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:03:48,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 377 [2018-11-06 21:03:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:48,033 INFO L225 Difference]: With dead ends: 46081 [2018-11-06 21:03:48,034 INFO L226 Difference]: Without dead ends: 24671 [2018-11-06 21:03:48,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 373 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2018-11-06 21:03:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24671 states. [2018-11-06 21:03:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24671 to 19178. [2018-11-06 21:03:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19178 states. [2018-11-06 21:03:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19178 states to 19178 states and 20737 transitions. [2018-11-06 21:03:48,326 INFO L78 Accepts]: Start accepts. Automaton has 19178 states and 20737 transitions. Word has length 377 [2018-11-06 21:03:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:48,327 INFO L480 AbstractCegarLoop]: Abstraction has 19178 states and 20737 transitions. [2018-11-06 21:03:48,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:03:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 19178 states and 20737 transitions. [2018-11-06 21:03:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-11-06 21:03:48,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:48,350 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:48,351 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:48,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1468023810, now seen corresponding path program 1 times [2018-11-06 21:03:48,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:48,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 112 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:48,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:48,943 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:03:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:49,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:49,632 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2018-11-06 21:03:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 153 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:51,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:51,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:03:51,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:03:51,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:03:51,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:03:51,014 INFO L87 Difference]: Start difference. First operand 19178 states and 20737 transitions. Second operand 10 states. [2018-11-06 21:03:51,324 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2018-11-06 21:04:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:00,043 INFO L93 Difference]: Finished difference Result 41536 states and 44882 transitions. [2018-11-06 21:04:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:04:00,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 421 [2018-11-06 21:04:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:00,066 INFO L225 Difference]: With dead ends: 41536 [2018-11-06 21:04:00,066 INFO L226 Difference]: Without dead ends: 22542 [2018-11-06 21:04:00,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:04:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22542 states. [2018-11-06 21:04:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22542 to 18997. [2018-11-06 21:04:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18997 states. [2018-11-06 21:04:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18997 states to 18997 states and 20454 transitions. [2018-11-06 21:04:00,317 INFO L78 Accepts]: Start accepts. Automaton has 18997 states and 20454 transitions. Word has length 421 [2018-11-06 21:04:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:00,317 INFO L480 AbstractCegarLoop]: Abstraction has 18997 states and 20454 transitions. [2018-11-06 21:04:00,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:04:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18997 states and 20454 transitions. [2018-11-06 21:04:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-11-06 21:04:00,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:00,371 INFO L375 BasicCegarLoop]: trace histogram [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, 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:04:00,371 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:00,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash -587775624, now seen corresponding path program 1 times [2018-11-06 21:04:00,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:00,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:00,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:00,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:00,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 644 proven. 507 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:04:01,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:01,266 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:04:01,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:01,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 707 proven. 444 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:04:03,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:03,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-06 21:04:03,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:04:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:04:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:04:03,239 INFO L87 Difference]: Start difference. First operand 18997 states and 20454 transitions. Second operand 11 states. [2018-11-06 21:04:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:10,894 INFO L93 Difference]: Finished difference Result 38375 states and 41296 transitions. [2018-11-06 21:04:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:04:10,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 707 [2018-11-06 21:04:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:10,896 INFO L225 Difference]: With dead ends: 38375 [2018-11-06 21:04:10,896 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:04:10,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-11-06 21:04:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:04:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:04:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:04:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:04:10,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 707 [2018-11-06 21:04:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:10,910 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:04:10,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:04:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:04:10,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:04:10,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:04:10,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:10,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,634 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 866 DAG size of output: 559 [2018-11-06 21:04:12,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:12,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:13,797 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 863 DAG size of output: 559 [2018-11-06 21:04:17,930 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 501 DAG size of output: 140 [2018-11-06 21:04:21,849 WARN L179 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 501 DAG size of output: 140 [2018-11-06 21:04:21,854 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:04:21,854 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:04:21,854 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:04:21,854 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:04:21,854 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:04:21,855 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,856 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,857 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:04:21,858 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse25 (+ ~a23~0 43))) (let ((.cse15 (= ~a25~0 13)) (.cse21 (= ~a4~0 1)) (.cse7 (< 0 .cse25)) (.cse11 (< 140 ~a29~0))) (let ((.cse6 (<= ~a29~0 130)) (.cse8 (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 (<= ~a29~0 245)) (.cse10 (= ~a25~0 9)) (.cse5 (<= ~a4~0 0)) (.cse17 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse7 .cse11)) (.cse18 (or .cse7 .cse11 (not (= ULTIMATE.start_calculate_output_~input 1)))) (.cse12 (<= ~a29~0 599998)) (.cse13 (and (not .cse15) (not .cse21))) (.cse20 (= ~a25~0 11)) (.cse2 (= ~a25~0 10)) (.cse19 (< 277 ~a29~0)) (.cse14 (<= .cse25 0)) (.cse9 (= ~a25~0 12)) (.cse0 (= ~a8~0 15)) (.cse16 (exists ((v_prenex_38 Int)) (let ((.cse24 (+ v_prenex_38 69157))) (and (<= 130 v_prenex_38) (<= ~a29~0 (+ (mod .cse24 299861) 300138)) (<= 0 .cse24))))) (.cse3 (= 1 ~a4~0)) (.cse4 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse7 (<= (+ ~a29~0 21) 0) .cse3 .cse4) (and .cse10 .cse6 .cse3) (and .cse9 .cse0 .cse11 .cse12 .cse13 .cse4 .cse14) (and .cse15 .cse0 .cse16 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse17 (<= (+ ~a29~0 22) 0) .cse18 .cse4) (and (and .cse10 .cse0 .cse19) .cse3 .cse4 .cse14) (and .cse15 .cse0 .cse11 .cse1 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse3 .cse20 .cse4) (and .cse0 .cse8 .cse4 (and .cse10 .cse7 .cse21)) (and .cse0 (and .cse7 .cse1 .cse2) .cse4) (and (and .cse10 .cse0 (and .cse7 .cse1)) .cse4) (and .cse10 .cse0 (exists ((v_prenex_32 Int)) (let ((.cse22 (mod v_prenex_32 299861))) (and (= 0 .cse22) (<= (+ .cse22 10250) ~a29~0) (< 140 v_prenex_32)))) .cse12 .cse4 .cse14) (and .cse15 .cse0 .cse1 .cse7 .cse4 (<= ~a23~0 262)) (and .cse0 (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))) .cse11 .cse20 .cse4) (and (and (and .cse10 .cse0) .cse4) (<= (+ ~a29~0 275923) 0)) (and .cse9 .cse0 .cse5 .cse17 .cse12 .cse18 (<= 130 ~a29~0) .cse4) (and .cse0 .cse12 .cse13 .cse20 .cse4) (and .cse9 .cse0 (exists ((v_prenex_38 Int)) (let ((.cse23 (+ v_prenex_38 69157))) (and (<= 130 v_prenex_38) (<= (+ ~a29~0 299882) (mod .cse23 299861)) (<= 0 .cse23)))) .cse3 .cse4) (and .cse15 .cse0 .cse7 (<= ~a23~0 306) .cse3 .cse4) (and (and .cse2 .cse19) .cse0 .cse3 .cse4 .cse14) (and .cse11 .cse9 .cse0 .cse16 .cse7 .cse3 .cse4))))) [2018-11-06 21:04:21,858 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,858 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,858 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:04:21,859 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,860 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:04:21,861 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,862 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,863 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:04:21,864 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,865 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:04:21,866 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,867 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:04:21,868 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,869 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,870 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:04:21,871 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,872 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,873 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:04:21,874 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:04:21,875 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:04:21,876 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,877 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,878 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,879 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,880 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:04:21,881 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:04:21,882 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:04:21,883 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:04:21,883 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,883 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,883 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,883 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse25 (+ ~a23~0 43))) (let ((.cse15 (= ~a25~0 13)) (.cse21 (= ~a4~0 1)) (.cse7 (< 0 .cse25)) (.cse11 (< 140 ~a29~0))) (let ((.cse6 (<= ~a29~0 130)) (.cse8 (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 (<= ~a29~0 245)) (.cse10 (= ~a25~0 9)) (.cse5 (<= ~a4~0 0)) (.cse17 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse7 .cse11)) (.cse18 (or .cse7 .cse11 (not (= ULTIMATE.start_calculate_output_~input 1)))) (.cse12 (<= ~a29~0 599998)) (.cse13 (and (not .cse15) (not .cse21))) (.cse20 (= ~a25~0 11)) (.cse2 (= ~a25~0 10)) (.cse19 (< 277 ~a29~0)) (.cse14 (<= .cse25 0)) (.cse9 (= ~a25~0 12)) (.cse0 (= ~a8~0 15)) (.cse16 (exists ((v_prenex_38 Int)) (let ((.cse24 (+ v_prenex_38 69157))) (and (<= 130 v_prenex_38) (<= ~a29~0 (+ (mod .cse24 299861) 300138)) (<= 0 .cse24))))) (.cse3 (= 1 ~a4~0)) (.cse4 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse7 (<= (+ ~a29~0 21) 0) .cse3 .cse4) (and .cse10 .cse6 .cse3) (and .cse9 .cse0 .cse11 .cse12 .cse13 .cse4 .cse14) (and .cse15 .cse0 .cse16 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse17 (<= (+ ~a29~0 22) 0) .cse18 .cse4) (and (and .cse10 .cse0 .cse19) .cse3 .cse4 .cse14) (and .cse15 .cse0 .cse11 .cse1 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse3 .cse20 .cse4) (and .cse0 .cse8 .cse4 (and .cse10 .cse7 .cse21)) (and .cse0 (and .cse7 .cse1 .cse2) .cse4) (and (and .cse10 .cse0 (and .cse7 .cse1)) .cse4) (and .cse10 .cse0 (exists ((v_prenex_32 Int)) (let ((.cse22 (mod v_prenex_32 299861))) (and (= 0 .cse22) (<= (+ .cse22 10250) ~a29~0) (< 140 v_prenex_32)))) .cse12 .cse4 .cse14) (and .cse15 .cse0 .cse1 .cse7 .cse4 (<= ~a23~0 262)) (and .cse0 (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))) .cse11 .cse20 .cse4) (and (and (and .cse10 .cse0) .cse4) (<= (+ ~a29~0 275923) 0)) (and .cse9 .cse0 .cse5 .cse17 .cse12 .cse18 (<= 130 ~a29~0) .cse4) (and .cse0 .cse12 .cse13 .cse20 .cse4) (and .cse9 .cse0 (exists ((v_prenex_38 Int)) (let ((.cse23 (+ v_prenex_38 69157))) (and (<= 130 v_prenex_38) (<= (+ ~a29~0 299882) (mod .cse23 299861)) (<= 0 .cse23)))) .cse3 .cse4) (and .cse15 .cse0 .cse7 (<= ~a23~0 306) .cse3 .cse4) (and (and .cse2 .cse19) .cse0 .cse3 .cse4 .cse14) (and .cse11 .cse9 .cse0 .cse16 .cse7 .cse3 .cse4))))) [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,884 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:04:21,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,900 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,900 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,932 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,932 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,932 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,933 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,934 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,935 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,936 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,937 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,938 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,938 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,938 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,938 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,941 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,942 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,942 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,942 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,943 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,943 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,943 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,944 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,944 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,944 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,944 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,945 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,945 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,945 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:04:21 BoogieIcfgContainer [2018-11-06 21:04:21,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:04:21,952 INFO L168 Benchmark]: Toolchain (without parser) took 135000.02 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -211.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:04:21,953 INFO L168 Benchmark]: CDTParser took 0.23 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:04:21,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 950.90 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:04:21,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 291.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:04:21,955 INFO L168 Benchmark]: Boogie Preprocessor took 145.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:04:21,957 INFO L168 Benchmark]: RCFGBuilder took 4475.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 7.1 GB. [2018-11-06 21:04:21,958 INFO L168 Benchmark]: TraceAbstraction took 129130.42 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 403.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:04:21,970 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.23 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 950.90 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 291.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4475.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129130.42 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 403.1 MB). Peak memory consumption was 2.4 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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,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_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: 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:04:21,986 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,986 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,986 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,994 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,994 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,994 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:21,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:21,998 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,998 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,998 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:21,998 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,999 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,999 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,999 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,999 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:21,999 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1) || ((((a8 == 15 && a4 <= 0) && a29 <= 130) && a25 == 10) && a3 == 1)) || (((((a8 == 15 && 0 < a23 + 43) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && 0 < a23 + 43) && a29 + 21 <= 0) && 1 == a4) && a3 == 1)) || ((a25 == 9 && a29 <= 130) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 599998) && !(a25 == 13) && !(a4 == 1)) && a3 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && (\exists v_prenex_38 : int :: (130 <= v_prenex_38 && a29 <= (v_prenex_38 + 69157) % 299861 + 300138) && 0 <= v_prenex_38 + 69157)) && 0 < a23 + 43) && 1 == a4) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && ((0 < a23 + 43 || 140 < a29) || !(input == 1))) && a3 == 1)) || (((((a25 == 9 && a8 == 15) && 277 < a29) && 1 == a4) && a3 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && 140 < a29) && a29 <= 245) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && 0 < a23 + 43) && (\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)) && a3 == 1) && (a25 == 9 && 0 < a23 + 43) && a4 == 1)) || ((a8 == 15 && (0 < a23 + 43 && a29 <= 245) && a25 == 10) && a3 == 1)) || (((a25 == 9 && a8 == 15) && 0 < a23 + 43 && a29 <= 245) && a3 == 1)) || (((((a25 == 9 && a8 == 15) && (\exists v_prenex_32 : int :: (0 == v_prenex_32 % 299861 && v_prenex_32 % 299861 + 10250 <= a29) && 140 < v_prenex_32)) && a29 <= 599998) && a3 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && a29 <= 245) && 0 < a23 + 43) && a3 == 1) && a23 <= 262)) || ((((a8 == 15 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && 140 < a29) && a25 == 11) && a3 == 1)) || (((a25 == 9 && a8 == 15) && a3 == 1) && a29 + 275923 <= 0)) || (((((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 <= 599998) && ((0 < a23 + 43 || 140 < a29) || !(input == 1))) && 130 <= a29) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && !(a25 == 13) && !(a4 == 1)) && a25 == 11) && a3 == 1)) || ((((a25 == 12 && a8 == 15) && (\exists v_prenex_38 : int :: (130 <= v_prenex_38 && a29 + 299882 <= (v_prenex_38 + 69157) % 299861) && 0 <= v_prenex_38 + 69157)) && 1 == a4) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && 0 < a23 + 43) && a23 <= 306) && 1 == a4) && a3 == 1)) || (((((a25 == 10 && 277 < a29) && a8 == 15) && 1 == a4) && a3 == 1) && a23 + 43 <= 0)) || ((((((140 < a29 && a25 == 12) && a8 == 15) && (\exists v_prenex_38 : int :: (130 <= v_prenex_38 && a29 <= (v_prenex_38 + 69157) % 299861 + 300138) && 0 <= v_prenex_38 + 69157)) && 0 < a23 + 43) && 1 == a4) && a3 == 1) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:04:22,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:22,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:22,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:22,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:22,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:22,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:22,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_510,QUANTIFIED] [2018-11-06 21:04:22,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:22,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:22,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_32,QUANTIFIED] [2018-11-06 21:04:22,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:22,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:22,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:04:22,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:04:22,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1) || ((((a8 == 15 && a4 <= 0) && a29 <= 130) && a25 == 10) && a3 == 1)) || (((((a8 == 15 && 0 < a23 + 43) && (\exists v_~a29~0_510 : int :: (a29 <= v_~a29~0_510 % 299861 + 300139 && 0 <= v_~a29~0_510) && 277 < v_~a29~0_510)) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && 0 < a23 + 43) && a29 + 21 <= 0) && 1 == a4) && a3 == 1)) || ((a25 == 9 && a29 <= 130) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 599998) && !(a25 == 13) && !(a4 == 1)) && a3 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && (\exists v_prenex_38 : int :: (130 <= v_prenex_38 && a29 <= (v_prenex_38 + 69157) % 299861 + 300138) && 0 <= v_prenex_38 + 69157)) && 0 < a23 + 43) && 1 == a4) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && ((0 < a23 + 43 || 140 < a29) || !(input == 1))) && a3 == 1)) || (((((a25 == 9 && a8 == 15) && 277 < a29) && 1 == a4) && a3 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && 140 < a29) && a29 <= 245) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && 0 < a23 + 43) && (\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)) && a3 == 1) && (a25 == 9 && 0 < a23 + 43) && a4 == 1)) || ((a8 == 15 && (0 < a23 + 43 && a29 <= 245) && a25 == 10) && a3 == 1)) || (((a25 == 9 && a8 == 15) && 0 < a23 + 43 && a29 <= 245) && a3 == 1)) || (((((a25 == 9 && a8 == 15) && (\exists v_prenex_32 : int :: (0 == v_prenex_32 % 299861 && v_prenex_32 % 299861 + 10250 <= a29) && 140 < v_prenex_32)) && a29 <= 599998) && a3 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && a29 <= 245) && 0 < a23 + 43) && a3 == 1) && a23 <= 262)) || ((((a8 == 15 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && 140 < a29) && a25 == 11) && a3 == 1)) || (((a25 == 9 && a8 == 15) && a3 == 1) && a29 + 275923 <= 0)) || (((((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 <= 599998) && ((0 < a23 + 43 || 140 < a29) || !(input == 1))) && 130 <= a29) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && !(a25 == 13) && !(a4 == 1)) && a25 == 11) && a3 == 1)) || ((((a25 == 12 && a8 == 15) && (\exists v_prenex_38 : int :: (130 <= v_prenex_38 && a29 + 299882 <= (v_prenex_38 + 69157) % 299861) && 0 <= v_prenex_38 + 69157)) && 1 == a4) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && 0 < a23 + 43) && a23 <= 306) && 1 == a4) && a3 == 1)) || (((((a25 == 10 && 277 < a29) && a8 == 15) && 1 == a4) && a3 == 1) && a23 + 43 <= 0)) || ((((((140 < a29 && a25 == 12) && a8 == 15) && (\exists v_prenex_38 : int :: (130 <= v_prenex_38 && a29 <= (v_prenex_38 + 69157) % 299861 + 300138) && 0 <= v_prenex_38 + 69157)) && 0 < a23 + 43) && 1 == a4) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 128.9s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 96.5s AutomataDifference, 0.0s DeadEndRemovalTime, 10.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2465 SDtfs, 17075 SDslu, 3208 SDs, 0 SdLazy, 54568 SolverSat, 7519 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 78.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2457 GetRequests, 2315 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23282occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 31859 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 286 NumberOfFragments, 1275 HoareAnnotationTreeSize, 3 FomulaSimplifications, 59844 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 35280 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 5811 NumberOfCodeBlocks, 5811 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5792 ConstructedInterpolants, 900 QuantifiedInterpolants, 20633112 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3052 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 3245/5842 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...