java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:01:54,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:01:54,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:01:54,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:01:54,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:01:54,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:01:54,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:01:54,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:01:54,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:01:54,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:01:54,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:01:54,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:01:54,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:01:54,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:01:54,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:01:54,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:01:54,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:01:54,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:01:54,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:01:54,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:01:54,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:01:54,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:01:54,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:01:54,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:01:54,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:01:54,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:01:54,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:01:54,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:01:54,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:01:54,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:01:54,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:01:54,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:01:54,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:01:54,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:01:54,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:01:54,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:01:54,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:01:54,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:01:54,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:01:54,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:01:54,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:01:54,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 00:01:54,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:01:54,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:01:54,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:01:54,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:01:54,253 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:01:54,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:01:54,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:01:54,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:01:54,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:01:54,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:01:54,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:01:54,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:01:54,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:01:54,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:01:54,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:01:54,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:01:54,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:01:54,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:01:54,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:01:54,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:01:54,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:01:54,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:01:54,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:01:54,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:01:54,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:01:54,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:01:54,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:01:54,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:01:54,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:01:54,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:01:54,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:01:54,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:01:54,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:01:54,546 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:01:54,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label45.c [2019-10-15 00:01:54,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cdabd4e/4c5649428ce54d1282eb19a85952d37a/FLAG3f78b9d19 [2019-10-15 00:01:55,226 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:01:55,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label45.c [2019-10-15 00:01:55,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cdabd4e/4c5649428ce54d1282eb19a85952d37a/FLAG3f78b9d19 [2019-10-15 00:01:55,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cdabd4e/4c5649428ce54d1282eb19a85952d37a [2019-10-15 00:01:55,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:01:55,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:01:55,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:01:55,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:01:55,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:01:55,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:01:55" (1/1) ... [2019-10-15 00:01:55,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e35f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:55, skipping insertion in model container [2019-10-15 00:01:55,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:01:55" (1/1) ... [2019-10-15 00:01:55,512 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:01:55,578 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:01:56,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:01:56,093 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:01:56,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:01:56,201 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:01:56,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56 WrapperNode [2019-10-15 00:01:56,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:01:56,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:01:56,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:01:56,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:01:56,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... [2019-10-15 00:01:56,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:01:56,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:01:56,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:01:56,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:01:56,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:01:56,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:01:56,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:01:56,373 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 00:01:56,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:01:56,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 00:01:56,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:01:56,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:01:56,374 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:01:56,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:01:56,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:01:56,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:01:57,599 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:01:57,599 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 00:01:57,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:01:57 BoogieIcfgContainer [2019-10-15 00:01:57,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:01:57,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:01:57,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:01:57,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:01:57,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:01:55" (1/3) ... [2019-10-15 00:01:57,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84aeedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:01:57, skipping insertion in model container [2019-10-15 00:01:57,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:01:56" (2/3) ... [2019-10-15 00:01:57,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84aeedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:01:57, skipping insertion in model container [2019-10-15 00:01:57,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:01:57" (3/3) ... [2019-10-15 00:01:57,609 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label45.c [2019-10-15 00:01:57,619 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:01:57,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:01:57,639 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:01:57,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:01:57,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:01:57,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:01:57,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:01:57,669 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:01:57,669 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:01:57,669 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:01:57,669 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:01:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-15 00:01:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 00:01:57,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:01:57,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:01:57,710 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:01:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:01:57,717 INFO L82 PathProgramCache]: Analyzing trace with hash 312365279, now seen corresponding path program 1 times [2019-10-15 00:01:57,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:01:57,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977871864] [2019-10-15 00:01:57,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:01:57,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:01:57,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:01:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:01:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:01:58,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977871864] [2019-10-15 00:01:58,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:01:58,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:01:58,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62600206] [2019-10-15 00:01:58,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:01:58,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:01:58,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:01:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:01:58,109 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2019-10-15 00:01:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:01:59,100 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2019-10-15 00:01:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:01:59,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-15 00:01:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:01:59,132 INFO L225 Difference]: With dead ends: 571 [2019-10-15 00:01:59,132 INFO L226 Difference]: Without dead ends: 294 [2019-10-15 00:01:59,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:01:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-15 00:01:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-15 00:01:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 00:01:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2019-10-15 00:01:59,234 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 44 [2019-10-15 00:01:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:01:59,235 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2019-10-15 00:01:59,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:01:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2019-10-15 00:01:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 00:01:59,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:01:59,243 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:01:59,244 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:01:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:01:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -78490639, now seen corresponding path program 1 times [2019-10-15 00:01:59,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:01:59,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24023428] [2019-10-15 00:01:59,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:01:59,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:01:59,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:01:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:01:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:01:59,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24023428] [2019-10-15 00:01:59,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:01:59,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:01:59,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802902874] [2019-10-15 00:01:59,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:01:59,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:01:59,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:01:59,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:01:59,479 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand 6 states. [2019-10-15 00:02:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:02:00,338 INFO L93 Difference]: Finished difference Result 741 states and 1061 transitions. [2019-10-15 00:02:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:02:00,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-10-15 00:02:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:02:00,343 INFO L225 Difference]: With dead ends: 741 [2019-10-15 00:02:00,343 INFO L226 Difference]: Without dead ends: 453 [2019-10-15 00:02:00,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:02:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-15 00:02:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2019-10-15 00:02:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-15 00:02:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 606 transitions. [2019-10-15 00:02:00,395 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 606 transitions. Word has length 113 [2019-10-15 00:02:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:02:00,398 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 606 transitions. [2019-10-15 00:02:00,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:02:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 606 transitions. [2019-10-15 00:02:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 00:02:00,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:02:00,406 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:02:00,407 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:02:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:02:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -681057027, now seen corresponding path program 1 times [2019-10-15 00:02:00,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:02:00,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727487588] [2019-10-15 00:02:00,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:02:00,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:02:00,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:02:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:02:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:02:00,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727487588] [2019-10-15 00:02:00,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105245207] [2019-10-15 00:02:00,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:02:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:02:00,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 00:02:00,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:02:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:02:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:02:03,019 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-15 00:02:03,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:02:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:02:03,272 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:02:03,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:02:03,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:02:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:02:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:02:03,582 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,643 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,755 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,809 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,861 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:03,958 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,011 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,062 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,131 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,327 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,377 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,425 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,517 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,553 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,600 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,639 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,705 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,748 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,802 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,847 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,883 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,918 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,951 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:04,994 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,093 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,139 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,235 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,275 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,359 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,572 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,656 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,690 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,792 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,839 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,897 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,946 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:05,999 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,103 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,166 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,288 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,340 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,387 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,446 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,493 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,529 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,602 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,653 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,831 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:06,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:07,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:07,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:07,183 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:07,254 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:07,322 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-15 00:02:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:02:07,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:02:07,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2019-10-15 00:02:07,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163760369] [2019-10-15 00:02:07,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:02:07,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:02:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:02:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-15 00:02:07,648 INFO L87 Difference]: Start difference. First operand 445 states and 606 transitions. Second operand 6 states. [2019-10-15 00:02:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:02:12,416 INFO L93 Difference]: Finished difference Result 1615 states and 2246 transitions. [2019-10-15 00:02:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:02:12,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-15 00:02:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:02:12,428 INFO L225 Difference]: With dead ends: 1615 [2019-10-15 00:02:12,428 INFO L226 Difference]: Without dead ends: 1176 [2019-10-15 00:02:12,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 169 SyntacticMatches, 74 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-15 00:02:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-10-15 00:02:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2019-10-15 00:02:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-10-15 00:02:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1553 transitions. [2019-10-15 00:02:12,478 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1553 transitions. Word has length 123 [2019-10-15 00:02:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:02:12,479 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1553 transitions. [2019-10-15 00:02:12,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:02:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1553 transitions. [2019-10-15 00:02:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-15 00:02:12,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:02:12,485 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:02:12,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:02:12,696 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:02:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:02:12,697 INFO L82 PathProgramCache]: Analyzing trace with hash -218804626, now seen corresponding path program 1 times [2019-10-15 00:02:12,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:02:12,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570581978] [2019-10-15 00:02:12,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:02:12,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:02:12,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:02:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:02:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 00:02:12,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570581978] [2019-10-15 00:02:12,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917325776] [2019-10-15 00:02:12,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:02:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:02:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 00:02:12,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:02:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:02:12,969 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:02:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:02:13,027 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:02:13,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 00:02:13,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552714767] [2019-10-15 00:02:13,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:02:13,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:02:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:02:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:02:13,030 INFO L87 Difference]: Start difference. First operand 1176 states and 1553 transitions. Second operand 3 states. [2019-10-15 00:02:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:02:13,716 INFO L93 Difference]: Finished difference Result 2042 states and 2737 transitions. [2019-10-15 00:02:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:02:13,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-15 00:02:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:02:13,734 INFO L225 Difference]: With dead ends: 2042 [2019-10-15 00:02:13,734 INFO L226 Difference]: Without dead ends: 2040 [2019-10-15 00:02:13,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:02:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2019-10-15 00:02:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1754. [2019-10-15 00:02:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-10-15 00:02:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2350 transitions. [2019-10-15 00:02:13,806 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2350 transitions. Word has length 172 [2019-10-15 00:02:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:02:13,807 INFO L462 AbstractCegarLoop]: Abstraction has 1754 states and 2350 transitions. [2019-10-15 00:02:13,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:02:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2350 transitions. [2019-10-15 00:02:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 00:02:13,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:02:13,814 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 00:02:14,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:02:14,027 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:02:14,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:02:14,028 INFO L82 PathProgramCache]: Analyzing trace with hash 973289144, now seen corresponding path program 1 times [2019-10-15 00:02:14,028 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:02:14,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530964736] [2019-10-15 00:02:14,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:02:14,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:02:14,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:02:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:02:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-15 00:02:14,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530964736] [2019-10-15 00:02:14,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:02:14,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:02:14,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426121513] [2019-10-15 00:02:14,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:02:14,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:02:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:02:14,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:02:14,166 INFO L87 Difference]: Start difference. First operand 1754 states and 2350 transitions. Second operand 4 states. [2019-10-15 00:02:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:02:15,213 INFO L93 Difference]: Finished difference Result 4219 states and 5681 transitions. [2019-10-15 00:02:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:02:15,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-10-15 00:02:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:02:15,214 INFO L225 Difference]: With dead ends: 4219 [2019-10-15 00:02:15,214 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:02:15,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:02:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:02:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:02:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:02:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:02:15,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-10-15 00:02:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:02:15,223 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:02:15,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:02:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:02:15,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:02:15,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:02:16,020 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 57 [2019-10-15 00:02:16,224 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-10-15 00:02:16,382 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-10-15 00:02:16,384 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:02:16,384 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse0 (forall ((v_~a1~0_BEFORE_CALL_5 Int)) (or (< |old(~a1~0)| v_~a1~0_BEFORE_CALL_5) (exists ((v_~a1~0_352 Int)) (and (<= (+ (div v_~a1~0_352 5) 331283) 0) (<= v_~a1~0_BEFORE_CALL_5 v_~a1~0_352) (= 0 (mod v_~a1~0_352 5))))))) (.cse1 (div ~a1~0 5))) (and (= ~a10~0 |old(~a10~0)|) (or .cse0 (< 0 (+ .cse1 331283)) (not (= (mod ~a1~0 5) 0))) (or .cse0 (< 0 (+ .cse1 331284))))) [2019-10-15 00:02:16,385 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:02:16,385 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-10-15 00:02:16,385 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,385 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,385 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-15 00:02:16,386 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,387 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,388 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,388 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-10-15 00:02:16,388 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-10-15 00:02:16,388 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-10-15 00:02:16,389 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-10-15 00:02:16,390 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-10-15 00:02:16,390 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-10-15 00:02:16,390 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-10-15 00:02:16,392 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-15 00:02:16,393 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-15 00:02:16,393 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-15 00:02:16,393 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-15 00:02:16,393 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-15 00:02:16,393 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-10-15 00:02:16,393 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,394 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,395 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-10-15 00:02:16,395 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-10-15 00:02:16,395 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-10-15 00:02:16,395 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-15 00:02:16,395 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-15 00:02:16,395 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-15 00:02:16,396 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-15 00:02:16,396 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-15 00:02:16,396 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-10-15 00:02:16,396 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-10-15 00:02:16,396 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-10-15 00:02:16,396 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-10-15 00:02:16,397 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-10-15 00:02:16,397 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,397 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,397 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,397 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,397 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-10-15 00:02:16,398 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,399 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-10-15 00:02:16,400 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,401 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-15 00:02:16,402 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,403 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-10-15 00:02:16,404 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse2 (= 1 |old(~a10~0)|)) (.cse6 (not (< 218 |old(~a1~0)|))) (.cse4 (exists ((v_~a1~0_352 Int)) (and (not (< v_~a1~0_352 |old(~a1~0)|)) (not (< 0 (+ (div v_~a1~0_352 5) 331283))) (= 0 (mod v_~a1~0_352 5))))) (.cse5 (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283))))) (.cse0 (= ~a10~0 |old(~a10~0)|)) (.cse1 (<= 9 ~a19~0)) (.cse3 (not (<= 9 |old(~a19~0)|)))) (and (or (and .cse0 .cse1) .cse2 .cse3) (or (not (= ~a19~0 8)) .cse4 (= 8 |old(~a19~0)|) .cse2) (or .cse4 (and .cse5 .cse0) .cse2) (or .cse0 .cse6) (or (< 218 ~a1~0) .cse6) (or .cse4 (not (= 7 |old(~a19~0)|)) (and .cse5 .cse0 (= ~a19~0 7)) (= 4 |old(~a10~0)|)) (or .cse4 (and .cse5 .cse0 .cse1) .cse3))) [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,405 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-10-15 00:02:16,406 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-10-15 00:02:16,407 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-10-15 00:02:16,408 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-10-15 00:02:16,409 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-10-15 00:02:16,410 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-15 00:02:16,410 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-15 00:02:16,410 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-15 00:02:16,410 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-15 00:02:16,410 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-15 00:02:16,410 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-15 00:02:16,411 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-10-15 00:02:16,411 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-10-15 00:02:16,411 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-10-15 00:02:16,411 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:02:16,411 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))) (not (= 1 ~a10~0)) (not (= ~a10~0 4)) (<= 9 ~a19~0)) [2019-10-15 00:02:16,412 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:02:16,412 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:02:16,412 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (exists ((v_~a1~0_352 Int)) (and (not (< v_~a1~0_352 |old(~a1~0)|)) (not (< 0 (+ (div v_~a1~0_352 5) 331283))) (= 0 (mod v_~a1~0_352 5)))) (= 4 |old(~a10~0)|) (and (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))) (= ~a10~0 |old(~a10~0)|) (<= 9 ~a19~0)) (= 1 |old(~a10~0)|) (not (<= 9 |old(~a19~0)|))) [2019-10-15 00:02:16,412 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2019-10-15 00:02:16,412 INFO L439 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= 1 ~a10~0))) (.cse1 (<= 9 ~a19~0)) (.cse2 (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))))) (or (exists ((v_~a1~0_352 Int)) (and (not (< v_~a1~0_352 |old(~a1~0)|)) (not (< 0 (+ (div v_~a1~0_352 5) 331283))) (= 0 (mod v_~a1~0_352 5)))) (= 4 |old(~a10~0)|) (< 218 ~a1~0) (and .cse0 .cse1) (and .cse2 .cse0) (and .cse2 .cse1) (and .cse2 (= ~a19~0 7)) (= 1 |old(~a10~0)|) (not (<= 9 |old(~a19~0)|)))) [2019-10-15 00:02:16,413 INFO L443 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2019-10-15 00:02:16,413 INFO L443 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-10-15 00:02:16,413 INFO L439 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= 1 ~a10~0))) (.cse1 (<= 9 ~a19~0)) (.cse2 (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))))) (or (exists ((v_~a1~0_352 Int)) (and (not (< v_~a1~0_352 |old(~a1~0)|)) (not (< 0 (+ (div v_~a1~0_352 5) 331283))) (= 0 (mod v_~a1~0_352 5)))) (= 4 |old(~a10~0)|) (< 218 ~a1~0) (and .cse0 .cse1) (and .cse2 .cse0) (and .cse2 .cse1) (and .cse2 (= ~a19~0 7)) (= 1 |old(~a10~0)|) (not (<= 9 |old(~a19~0)|)))) [2019-10-15 00:02:16,413 INFO L443 ceAbstractionStarter]: For program point L582-3(lines 576 592) no Hoare annotation was computed. [2019-10-15 00:02:16,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:02:16 BoogieIcfgContainer [2019-10-15 00:02:16,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:02:16,464 INFO L168 Benchmark]: Toolchain (without parser) took 20968.38 ms. Allocated memory was 146.3 MB in the beginning and 375.9 MB in the end (delta: 229.6 MB). Free memory was 101.1 MB in the beginning and 341.4 MB in the end (delta: -240.3 MB). Peak memory consumption was 241.3 MB. Max. memory is 7.1 GB. [2019-10-15 00:02:16,465 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:02:16,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.70 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 100.9 MB in the beginning and 172.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-10-15 00:02:16,468 INFO L168 Benchmark]: Boogie Preprocessor took 115.39 ms. Allocated memory is still 206.0 MB. Free memory was 172.3 MB in the beginning and 167.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-10-15 00:02:16,470 INFO L168 Benchmark]: RCFGBuilder took 1282.60 ms. Allocated memory was 206.0 MB in the beginning and 239.1 MB in the end (delta: 33.0 MB). Free memory was 167.2 MB in the beginning and 182.2 MB in the end (delta: -15.1 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-10-15 00:02:16,474 INFO L168 Benchmark]: TraceAbstraction took 18860.03 ms. Allocated memory was 239.1 MB in the beginning and 375.9 MB in the end (delta: 136.8 MB). Free memory was 182.2 MB in the beginning and 341.4 MB in the end (delta: -159.1 MB). Peak memory consumption was 229.6 MB. Max. memory is 7.1 GB. [2019-10-15 00:02:16,481 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 705.70 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 100.9 MB in the beginning and 172.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.39 ms. Allocated memory is still 206.0 MB. Free memory was 172.3 MB in the beginning and 167.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1282.60 ms. Allocated memory was 206.0 MB in the beginning and 239.1 MB in the end (delta: 33.0 MB). Free memory was 167.2 MB in the beginning and 182.2 MB in the end (delta: -15.1 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18860.03 ms. Allocated memory was 239.1 MB in the beginning and 375.9 MB in the end (delta: 136.8 MB). Free memory was 182.2 MB in the beginning and 341.4 MB in the end (delta: -159.1 MB). Peak memory consumption was 229.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2019-10-15 00:02:16,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2019-10-15 00:02:16,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] Derived loop invariant: ((((((((\exists v_~a1~0_352 : int :: (!(v_~a1~0_352 < \old(a1)) && !(0 < v_~a1~0_352 / 5 + 331283)) && 0 == v_~a1~0_352 % 5) || 4 == \old(a10)) || 218 < a1) || (!(1 == a10) && 9 <= a19)) || ((forall v_~a1~0_352 : int :: (!(0 == v_~a1~0_352 % 5) || v_~a1~0_352 < a1) || 0 < v_~a1~0_352 / 5 + 331283) && !(1 == a10))) || ((forall v_~a1~0_352 : int :: (!(0 == v_~a1~0_352 % 5) || v_~a1~0_352 < a1) || 0 < v_~a1~0_352 / 5 + 331283) && 9 <= a19)) || ((forall v_~a1~0_352 : int :: (!(0 == v_~a1~0_352 % 5) || v_~a1~0_352 < a1) || 0 < v_~a1~0_352 / 5 + 331283) && a19 == 7)) || 1 == \old(a10)) || !(9 <= \old(a19)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Result: SAFE, OverallTime: 18.7s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 163 SDtfs, 1540 SDslu, 104 SDs, 0 SdLazy, 3051 SolverSat, 762 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 522 SyntacticMatches, 78 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1754occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 294 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 41 PreInvPairs, 75 NumberOfFragments, 580 HoareAnnotationTreeSize, 41 FomulaSimplifications, 834 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1197 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1246 ConstructedInterpolants, 122 QuantifiedInterpolants, 1148032 SizeOfPredicates, 5 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 330/415 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...