./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc86a08ff37d05adddb13279399a852f6ece83c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:12:33,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:12:33,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:12:33,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:12:33,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:12:33,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:12:33,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:12:33,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:12:33,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:12:33,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:12:33,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:12:33,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:12:33,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:12:33,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:12:33,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:12:33,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:12:33,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:12:33,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:12:33,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:12:33,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:12:33,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:12:33,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:12:33,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:12:33,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:12:33,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:12:33,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:12:33,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:12:33,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:12:33,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:12:33,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:12:33,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:12:33,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:12:33,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:12:33,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:12:33,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:12:33,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:12:33,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:12:33,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:12:33,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:12:33,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:12:33,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:12:33,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:12:33,245 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:12:33,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:12:33,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:12:33,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:12:33,247 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:12:33,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:12:33,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:12:33,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:12:33,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:12:33,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:12:33,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:12:33,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:12:33,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:12:33,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:12:33,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:12:33,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:12:33,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:12:33,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:12:33,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:12:33,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:12:33,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:12:33,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:12:33,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:12:33,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:12:33,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:12:33,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:12:33,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:12:33,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:12:33,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2019-11-15 23:12:33,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:12:33,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:12:33,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:12:33,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:12:33,292 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:12:33,292 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-15 23:12:33,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/data/9e09982b1/69ca981ead2c4719ba5720e0b625a550/FLAG7e040f3ba [2019-11-15 23:12:33,735 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:12:33,738 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-15 23:12:33,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/data/9e09982b1/69ca981ead2c4719ba5720e0b625a550/FLAG7e040f3ba [2019-11-15 23:12:33,755 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/data/9e09982b1/69ca981ead2c4719ba5720e0b625a550 [2019-11-15 23:12:33,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:12:33,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:12:33,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:33,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:12:33,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:12:33,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:33" (1/1) ... [2019-11-15 23:12:33,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a59639e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:33, skipping insertion in model container [2019-11-15 23:12:33,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:33" (1/1) ... [2019-11-15 23:12:33,773 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:12:33,794 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:12:34,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:34,036 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:12:34,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:34,064 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:12:34,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34 WrapperNode [2019-11-15 23:12:34,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:34,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:34,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:12:34,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:12:34,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:34,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:12:34,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:12:34,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:12:34,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... [2019-11-15 23:12:34,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:12:34,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:12:34,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:12:34,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:12:34,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/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-11-15 23:12:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:12:34,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:12:34,453 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:12:34,453 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-15 23:12:34,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:34 BoogieIcfgContainer [2019-11-15 23:12:34,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:12:34,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:12:34,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:12:34,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:12:34,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:12:33" (1/3) ... [2019-11-15 23:12:34,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b3e045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:34, skipping insertion in model container [2019-11-15 23:12:34,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:34" (2/3) ... [2019-11-15 23:12:34,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b3e045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:34, skipping insertion in model container [2019-11-15 23:12:34,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:34" (3/3) ... [2019-11-15 23:12:34,473 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-11-15 23:12:34,481 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:12:34,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-15 23:12:34,497 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-15 23:12:34,521 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:12:34,521 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:12:34,521 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:12:34,521 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:12:34,522 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:12:34,522 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:12:34,522 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:12:34,522 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:12:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-15 23:12:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:12:34,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:34,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:34,548 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1242509755, now seen corresponding path program 1 times [2019-11-15 23:12:34,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:34,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166873094] [2019-11-15 23:12:34,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:34,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:34,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:34,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166873094] [2019-11-15 23:12:34,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:34,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:34,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716366314] [2019-11-15 23:12:34,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:34,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:34,718 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-11-15 23:12:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:34,855 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2019-11-15 23:12:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:34,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-15 23:12:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:34,866 INFO L225 Difference]: With dead ends: 144 [2019-11-15 23:12:34,866 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:12:34,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:12:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-11-15 23:12:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:12:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-15 23:12:34,922 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2019-11-15 23:12:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:34,922 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-15 23:12:34,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-15 23:12:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:12:34,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:34,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:34,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1242533587, now seen corresponding path program 1 times [2019-11-15 23:12:34,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:34,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514916220] [2019-11-15 23:12:34,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:34,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:34,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:34,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514916220] [2019-11-15 23:12:34,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:34,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:12:34,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758849071] [2019-11-15 23:12:34,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:34,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:34,986 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2019-11-15 23:12:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:35,107 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-15 23:12:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:12:35,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-15 23:12:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:35,109 INFO L225 Difference]: With dead ends: 71 [2019-11-15 23:12:35,109 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:12:35,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:12:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2019-11-15 23:12:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 23:12:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-15 23:12:35,119 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2019-11-15 23:12:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:35,120 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-15 23:12:35,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-15 23:12:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:12:35,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:35,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:35,121 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1242439254, now seen corresponding path program 1 times [2019-11-15 23:12:35,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:35,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591758926] [2019-11-15 23:12:35,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:35,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591758926] [2019-11-15 23:12:35,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:35,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:12:35,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072054802] [2019-11-15 23:12:35,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:12:35,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:12:35,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:35,185 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2019-11-15 23:12:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:35,440 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2019-11-15 23:12:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:12:35,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-15 23:12:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:35,443 INFO L225 Difference]: With dead ends: 127 [2019-11-15 23:12:35,443 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 23:12:35,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:12:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 23:12:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2019-11-15 23:12:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:12:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-11-15 23:12:35,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 8 [2019-11-15 23:12:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:35,467 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-11-15 23:12:35,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:12:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-11-15 23:12:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:12:35,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:35,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:35,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 51126654, now seen corresponding path program 1 times [2019-11-15 23:12:35,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:35,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433244651] [2019-11-15 23:12:35,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:35,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433244651] [2019-11-15 23:12:35,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:35,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:12:35,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519815635] [2019-11-15 23:12:35,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:35,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:35,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:35,550 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 6 states. [2019-11-15 23:12:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:35,797 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-11-15 23:12:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:12:35,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-15 23:12:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:35,799 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:12:35,799 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 23:12:35,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:12:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 23:12:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2019-11-15 23:12:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 23:12:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-11-15 23:12:35,816 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 10 [2019-11-15 23:12:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:35,816 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-11-15 23:12:35,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-11-15 23:12:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:12:35,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:35,818 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:35,818 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 74029974, now seen corresponding path program 1 times [2019-11-15 23:12:35,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:35,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082739359] [2019-11-15 23:12:35,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:35,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082739359] [2019-11-15 23:12:35,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:35,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:12:35,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316842131] [2019-11-15 23:12:35,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:35,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:35,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:35,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:35,852 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 4 states. [2019-11-15 23:12:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:35,946 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2019-11-15 23:12:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:12:35,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 23:12:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:35,948 INFO L225 Difference]: With dead ends: 137 [2019-11-15 23:12:35,948 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 23:12:35,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 23:12:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2019-11-15 23:12:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:12:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2019-11-15 23:12:35,965 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 10 [2019-11-15 23:12:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:35,966 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2019-11-15 23:12:35,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2019-11-15 23:12:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:12:35,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:35,967 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:35,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -16628999, now seen corresponding path program 1 times [2019-11-15 23:12:35,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:35,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684238415] [2019-11-15 23:12:35,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:35,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684238415] [2019-11-15 23:12:36,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:36,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:12:36,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937381669] [2019-11-15 23:12:36,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:12:36,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:12:36,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:36,014 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 5 states. [2019-11-15 23:12:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:36,226 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2019-11-15 23:12:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:12:36,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 23:12:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:36,230 INFO L225 Difference]: With dead ends: 216 [2019-11-15 23:12:36,230 INFO L226 Difference]: Without dead ends: 208 [2019-11-15 23:12:36,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:12:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-15 23:12:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 160. [2019-11-15 23:12:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-15 23:12:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2019-11-15 23:12:36,270 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 10 [2019-11-15 23:12:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:36,271 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2019-11-15 23:12:36,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:12:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2019-11-15 23:12:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:12:36,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:36,273 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:36,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -758219972, now seen corresponding path program 1 times [2019-11-15 23:12:36,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:36,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038502027] [2019-11-15 23:12:36,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038502027] [2019-11-15 23:12:36,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:36,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:36,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675269947] [2019-11-15 23:12:36,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:36,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:36,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:36,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:36,321 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand 3 states. [2019-11-15 23:12:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:36,358 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2019-11-15 23:12:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:36,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 23:12:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:36,360 INFO L225 Difference]: With dead ends: 320 [2019-11-15 23:12:36,360 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 23:12:36,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 23:12:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 191. [2019-11-15 23:12:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-15 23:12:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2019-11-15 23:12:36,388 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 10 [2019-11-15 23:12:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:36,388 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2019-11-15 23:12:36,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2019-11-15 23:12:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:12:36,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:36,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:36,393 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1017268915, now seen corresponding path program 1 times [2019-11-15 23:12:36,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:36,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047202600] [2019-11-15 23:12:36,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047202600] [2019-11-15 23:12:36,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:36,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:12:36,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669535434] [2019-11-15 23:12:36,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:12:36,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:12:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:36,463 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand 5 states. [2019-11-15 23:12:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:36,649 INFO L93 Difference]: Finished difference Result 287 states and 363 transitions. [2019-11-15 23:12:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:12:36,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 23:12:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:36,651 INFO L225 Difference]: With dead ends: 287 [2019-11-15 23:12:36,651 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 23:12:36,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:12:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 23:12:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2019-11-15 23:12:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-15 23:12:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2019-11-15 23:12:36,669 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 11 [2019-11-15 23:12:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:36,669 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2019-11-15 23:12:36,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:12:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2019-11-15 23:12:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:12:36,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:36,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:36,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash 173914847, now seen corresponding path program 1 times [2019-11-15 23:12:36,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:36,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376497768] [2019-11-15 23:12:36,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376497768] [2019-11-15 23:12:36,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:36,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:12:36,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637443737] [2019-11-15 23:12:36,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:12:36,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:12:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:12:36,706 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand 5 states. [2019-11-15 23:12:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:36,874 INFO L93 Difference]: Finished difference Result 302 states and 371 transitions. [2019-11-15 23:12:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:12:36,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-15 23:12:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:36,877 INFO L225 Difference]: With dead ends: 302 [2019-11-15 23:12:36,877 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 23:12:36,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:12:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 23:12:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 241. [2019-11-15 23:12:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-15 23:12:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 304 transitions. [2019-11-15 23:12:36,901 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 304 transitions. Word has length 14 [2019-11-15 23:12:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:36,901 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 304 transitions. [2019-11-15 23:12:36,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:12:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2019-11-15 23:12:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:12:36,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:36,902 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:36,903 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:36,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1061608090, now seen corresponding path program 1 times [2019-11-15 23:12:36,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:36,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351492147] [2019-11-15 23:12:36,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:36,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:36,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351492147] [2019-11-15 23:12:36,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325127118] [2019-11-15 23:12:36,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/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-11-15 23:12:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:37,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:12:37,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:37,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:37,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:12:37,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-11-15 23:12:37,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540862392] [2019-11-15 23:12:37,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:37,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:12:37,143 INFO L87 Difference]: Start difference. First operand 241 states and 304 transitions. Second operand 6 states. [2019-11-15 23:12:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:37,341 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2019-11-15 23:12:37,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:12:37,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:12:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:37,343 INFO L225 Difference]: With dead ends: 242 [2019-11-15 23:12:37,343 INFO L226 Difference]: Without dead ends: 234 [2019-11-15 23:12:37,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:12:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-15 23:12:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-11-15 23:12:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 23:12:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2019-11-15 23:12:37,363 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 15 [2019-11-15 23:12:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:37,363 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2019-11-15 23:12:37,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2019-11-15 23:12:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:12:37,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:37,364 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:37,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:37,569 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -371397790, now seen corresponding path program 1 times [2019-11-15 23:12:37,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:37,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362334100] [2019-11-15 23:12:37,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:37,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:37,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:37,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362334100] [2019-11-15 23:12:37,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:37,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:12:37,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547011645] [2019-11-15 23:12:37,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:37,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:37,613 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand 6 states. [2019-11-15 23:12:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:37,895 INFO L93 Difference]: Finished difference Result 446 states and 543 transitions. [2019-11-15 23:12:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:12:37,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-15 23:12:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:37,898 INFO L225 Difference]: With dead ends: 446 [2019-11-15 23:12:37,898 INFO L226 Difference]: Without dead ends: 444 [2019-11-15 23:12:37,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:12:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-15 23:12:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 368. [2019-11-15 23:12:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:12:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 456 transitions. [2019-11-15 23:12:37,930 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 456 transitions. Word has length 16 [2019-11-15 23:12:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:37,931 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 456 transitions. [2019-11-15 23:12:37,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 456 transitions. [2019-11-15 23:12:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:12:37,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:37,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:37,932 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1382515040, now seen corresponding path program 1 times [2019-11-15 23:12:37,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:37,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970710362] [2019-11-15 23:12:37,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:37,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:37,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:37,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970710362] [2019-11-15 23:12:37,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:37,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:12:37,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034632893] [2019-11-15 23:12:37,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:37,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:37,974 INFO L87 Difference]: Start difference. First operand 368 states and 456 transitions. Second operand 6 states. [2019-11-15 23:12:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:38,262 INFO L93 Difference]: Finished difference Result 408 states and 495 transitions. [2019-11-15 23:12:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:12:38,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-15 23:12:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:38,265 INFO L225 Difference]: With dead ends: 408 [2019-11-15 23:12:38,265 INFO L226 Difference]: Without dead ends: 406 [2019-11-15 23:12:38,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:12:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-15 23:12:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 299. [2019-11-15 23:12:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-15 23:12:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 370 transitions. [2019-11-15 23:12:38,291 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 370 transitions. Word has length 16 [2019-11-15 23:12:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:38,291 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 370 transitions. [2019-11-15 23:12:38,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 370 transitions. [2019-11-15 23:12:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:12:38,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:38,292 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] [2019-11-15 23:12:38,293 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1085410132, now seen corresponding path program 1 times [2019-11-15 23:12:38,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:38,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411146677] [2019-11-15 23:12:38,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:38,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:38,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411146677] [2019-11-15 23:12:38,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:38,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:12:38,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831583725] [2019-11-15 23:12:38,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:38,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:38,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:38,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:12:38,353 INFO L87 Difference]: Start difference. First operand 299 states and 370 transitions. Second operand 6 states. [2019-11-15 23:12:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:38,602 INFO L93 Difference]: Finished difference Result 439 states and 533 transitions. [2019-11-15 23:12:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:12:38,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 23:12:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:38,605 INFO L225 Difference]: With dead ends: 439 [2019-11-15 23:12:38,605 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 23:12:38,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:12:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 23:12:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 207. [2019-11-15 23:12:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-15 23:12:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2019-11-15 23:12:38,626 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 20 [2019-11-15 23:12:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:38,627 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2019-11-15 23:12:38,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2019-11-15 23:12:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:12:38,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:38,628 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:38,629 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1447113763, now seen corresponding path program 1 times [2019-11-15 23:12:38,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:38,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153691398] [2019-11-15 23:12:38,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:38,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:38,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153691398] [2019-11-15 23:12:38,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752094500] [2019-11-15 23:12:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/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-11-15 23:12:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:38,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:12:38,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:38,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:38,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:12:38,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-11-15 23:12:38,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622300226] [2019-11-15 23:12:38,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:38,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:12:38,806 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand 6 states. [2019-11-15 23:12:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:38,971 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2019-11-15 23:12:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:12:38,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 23:12:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:38,973 INFO L225 Difference]: With dead ends: 248 [2019-11-15 23:12:38,973 INFO L226 Difference]: Without dead ends: 246 [2019-11-15 23:12:38,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:12:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-15 23:12:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 109. [2019-11-15 23:12:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 23:12:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-11-15 23:12:38,987 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 21 [2019-11-15 23:12:38,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:38,987 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-11-15 23:12:38,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-11-15 23:12:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:12:38,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:38,989 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:39,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:39,200 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1066677303, now seen corresponding path program 1 times [2019-11-15 23:12:39,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:39,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770478942] [2019-11-15 23:12:39,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:39,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:39,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:39,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770478942] [2019-11-15 23:12:39,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049422282] [2019-11-15 23:12:39,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:39,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:39,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:39,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:12:39,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-11-15 23:12:39,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296564766] [2019-11-15 23:12:39,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:12:39,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:12:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:12:39,377 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 6 states. [2019-11-15 23:12:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:39,632 INFO L93 Difference]: Finished difference Result 399 states and 467 transitions. [2019-11-15 23:12:39,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:12:39,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-15 23:12:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:39,635 INFO L225 Difference]: With dead ends: 399 [2019-11-15 23:12:39,635 INFO L226 Difference]: Without dead ends: 293 [2019-11-15 23:12:39,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:12:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-15 23:12:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 255. [2019-11-15 23:12:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 23:12:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2019-11-15 23:12:39,673 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 30 [2019-11-15 23:12:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:39,673 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2019-11-15 23:12:39,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:12:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2019-11-15 23:12:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:12:39,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:39,676 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:12:39,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:39,889 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 478455163, now seen corresponding path program 1 times [2019-11-15 23:12:39,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:39,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056000330] [2019-11-15 23:12:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:40,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056000330] [2019-11-15 23:12:40,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767204436] [2019-11-15 23:12:40,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:40,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:12:40,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:40,304 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:40,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-15 23:12:40,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501875914] [2019-11-15 23:12:40,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:12:40,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:12:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:12:40,308 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand 18 states. [2019-11-15 23:12:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:45,546 INFO L93 Difference]: Finished difference Result 936 states and 1063 transitions. [2019-11-15 23:12:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-11-15 23:12:45,547 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-11-15 23:12:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:45,549 INFO L225 Difference]: With dead ends: 936 [2019-11-15 23:12:45,549 INFO L226 Difference]: Without dead ends: 391 [2019-11-15 23:12:45,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1395, Invalid=8307, Unknown=0, NotChecked=0, Total=9702 [2019-11-15 23:12:45,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-15 23:12:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 152. [2019-11-15 23:12:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 23:12:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2019-11-15 23:12:45,574 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 37 [2019-11-15 23:12:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:45,575 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2019-11-15 23:12:45,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:12:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2019-11-15 23:12:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:12:45,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:45,577 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:12:45,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:45,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:45,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1811445003, now seen corresponding path program 1 times [2019-11-15 23:12:45,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:45,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422029245] [2019-11-15 23:12:45,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:45,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:45,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:45,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422029245] [2019-11-15 23:12:45,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272339604] [2019-11-15 23:12:45,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:45,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:12:45,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:45,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:45,914 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:45,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 23:12:45,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677673117] [2019-11-15 23:12:45,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:12:45,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:45,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:12:45,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:12:45,915 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand 8 states. [2019-11-15 23:12:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:46,174 INFO L93 Difference]: Finished difference Result 176 states and 200 transitions. [2019-11-15 23:12:46,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:12:46,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-15 23:12:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:46,176 INFO L225 Difference]: With dead ends: 176 [2019-11-15 23:12:46,176 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 23:12:46,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:12:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 23:12:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2019-11-15 23:12:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 23:12:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2019-11-15 23:12:46,195 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 53 [2019-11-15 23:12:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:46,195 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2019-11-15 23:12:46,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:12:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2019-11-15 23:12:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:12:46,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:46,196 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:46,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:46,399 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1337051790, now seen corresponding path program 1 times [2019-11-15 23:12:46,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:46,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637869293] [2019-11-15 23:12:46,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:46,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637869293] [2019-11-15 23:12:46,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739761634] [2019-11-15 23:12:46,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:46,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:12:46,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:46,639 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:46,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-11-15 23:12:46,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163322560] [2019-11-15 23:12:46,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:12:46,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:12:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:12:46,641 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand 13 states. [2019-11-15 23:12:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:47,363 INFO L93 Difference]: Finished difference Result 321 states and 360 transitions. [2019-11-15 23:12:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 23:12:47,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-11-15 23:12:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:47,368 INFO L225 Difference]: With dead ends: 321 [2019-11-15 23:12:47,368 INFO L226 Difference]: Without dead ends: 319 [2019-11-15 23:12:47,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=736, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:12:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-15 23:12:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2019-11-15 23:12:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-15 23:12:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2019-11-15 23:12:47,404 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 55 [2019-11-15 23:12:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:47,406 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2019-11-15 23:12:47,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:12:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2019-11-15 23:12:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:12:47,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:47,408 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:47,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:47,618 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash -586176244, now seen corresponding path program 1 times [2019-11-15 23:12:47,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:47,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747313845] [2019-11-15 23:12:47,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:47,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:47,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:47,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747313845] [2019-11-15 23:12:47,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79876186] [2019-11-15 23:12:47,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:47,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:12:47,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:47,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:47,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-15 23:12:47,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765173573] [2019-11-15 23:12:47,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:12:47,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:12:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:12:47,959 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 18 states. [2019-11-15 23:12:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:54,848 INFO L93 Difference]: Finished difference Result 1647 states and 1835 transitions. [2019-11-15 23:12:54,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-11-15 23:12:54,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-15 23:12:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:54,853 INFO L225 Difference]: With dead ends: 1647 [2019-11-15 23:12:54,854 INFO L226 Difference]: Without dead ends: 953 [2019-11-15 23:12:54,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7752 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3202, Invalid=17104, Unknown=0, NotChecked=0, Total=20306 [2019-11-15 23:12:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-11-15 23:12:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 316. [2019-11-15 23:12:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-15 23:12:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 357 transitions. [2019-11-15 23:12:54,906 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 357 transitions. Word has length 55 [2019-11-15 23:12:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 357 transitions. [2019-11-15 23:12:54,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:12:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 357 transitions. [2019-11-15 23:12:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:12:54,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:54,907 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:55,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:55,108 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2004720992, now seen corresponding path program 2 times [2019-11-15 23:12:55,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:55,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855131512] [2019-11-15 23:12:55,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:55,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:55,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:55,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855131512] [2019-11-15 23:12:55,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618815943] [2019-11-15 23:12:55,291 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:55,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:12:55,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:12:55,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:55,558 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:55,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-11-15 23:12:55,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322442185] [2019-11-15 23:12:55,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:12:55,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:12:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:12:55,560 INFO L87 Difference]: Start difference. First operand 316 states and 357 transitions. Second operand 19 states. [2019-11-15 23:12:57,254 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-15 23:13:01,010 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-15 23:13:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:13:01,227 INFO L93 Difference]: Finished difference Result 764 states and 845 transitions. [2019-11-15 23:13:01,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-11-15 23:13:01,227 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2019-11-15 23:13:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:13:01,228 INFO L225 Difference]: With dead ends: 764 [2019-11-15 23:13:01,228 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:13:01,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2032, Invalid=5978, Unknown=0, NotChecked=0, Total=8010 [2019-11-15 23:13:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:13:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:13:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:13:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:13:01,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2019-11-15 23:13:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:13:01,232 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:13:01,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:13:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:13:01,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:13:01,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:13:01,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:13:02,499 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 376 DAG size of output: 321 [2019-11-15 23:13:03,276 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 285 [2019-11-15 23:13:03,493 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 224 [2019-11-15 23:13:04,263 WARN L191 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 332 [2019-11-15 23:13:04,811 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 309 [2019-11-15 23:13:05,285 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 284 [2019-11-15 23:13:05,413 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 227 [2019-11-15 23:13:05,962 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 314 [2019-11-15 23:13:06,366 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 310 [2019-11-15 23:13:06,642 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 296 [2019-11-15 23:13:06,827 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 226 [2019-11-15 23:13:06,928 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 224 [2019-11-15 23:13:07,423 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 333 [2019-11-15 23:13:07,666 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 227 [2019-11-15 23:13:10,357 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 313 DAG size of output: 69 [2019-11-15 23:13:11,551 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 279 DAG size of output: 29 [2019-11-15 23:13:16,233 WARN L191 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 222 DAG size of output: 90 [2019-11-15 23:13:18,516 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 323 DAG size of output: 74 [2019-11-15 23:13:21,398 WARN L191 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 296 DAG size of output: 81 [2019-11-15 23:13:22,581 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 278 DAG size of output: 19 [2019-11-15 23:13:24,568 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 224 DAG size of output: 100 [2019-11-15 23:13:27,075 WARN L191 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 310 DAG size of output: 74 [2019-11-15 23:13:29,433 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 300 DAG size of output: 70 [2019-11-15 23:13:34,623 WARN L191 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 282 DAG size of output: 123 [2019-11-15 23:13:35,187 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 27 [2019-11-15 23:13:37,772 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 222 DAG size of output: 90 [2019-11-15 23:13:39,699 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 329 DAG size of output: 81 [2019-11-15 23:13:41,612 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 224 DAG size of output: 100 [2019-11-15 23:13:42,144 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 25 [2019-11-15 23:13:42,145 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,146 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:13:42,146 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,146 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,146 INFO L439 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_main_~j~0 2)) (.cse12 (* 6 ULTIMATE.start_main_~l~0)) (.cse13 (* 8 ULTIMATE.start_main_~n~0)) (.cse15 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse3 (<= (+ .cse15 2) ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse12) (+ .cse13 (* 3 ULTIMATE.start_main_~j~0)))) (.cse5 (<= .cse15 ULTIMATE.start_main_~r~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse1 (<= 2 ULTIMATE.start_main_~i~0)) (.cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse19 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse19 1)) (<= 1 .cse19))))) (.cse11 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse16 (<= 1 ULTIMATE.start_main_~r~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ .cse18 1))) (.cse7 (<= ULTIMATE.start_main_~j~0 .cse15))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse5)) .cse10 .cse11 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse12 3) .cse13)) (and .cse14 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse2 .cse3 .cse10 .cse11 .cse5)) (and .cse0 .cse7 (<= .cse15 ULTIMATE.start_main_~j~0) .cse9 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse10 .cse14 .cse5 (<= 2 ULTIMATE.start_main_~j~0)) (and (and .cse2 .cse16 .cse17) .cse0 .cse1 .cse10 .cse4 .cse11) (and (and (<= 1 .cse18) .cse8 .cse9 .cse2 .cse10 .cse16 .cse17) .cse6 .cse7)))) [2019-11-15 23:13:42,146 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,146 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,147 INFO L439 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse17 (- ULTIMATE.start_main_~r~0)) (.cse4 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse12 (<= 2 ULTIMATE.start_main_~j~0)) (.cse18 (* 6 ULTIMATE.start_main_~l~0)) (.cse19 (* 8 ULTIMATE.start_main_~n~0))) (let ((.cse8 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse18) (+ .cse19 (* 3 ULTIMATE.start_main_~j~0)))) (.cse13 (and .cse4 .cse1 .cse3 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse12)) (.cse16 (<= (div (+ .cse17 (- 1)) (- 2)) (+ (div ULTIMATE.start_main_~j~0 2) 1))) (.cse9 (<= ULTIMATE.start_main_~j~0 .cse10)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse11 (<= 1 ULTIMATE.start_main_~i~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse5 (<= (+ .cse10 2) ULTIMATE.start_main_~n~0)) (.cse14 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse20 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse20 1)) (<= 1 .cse20))))) (.cse7 (<= .cse10 ULTIMATE.start_main_~r~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0)))) (and .cse0 .cse9 (<= .cse10 ULTIMATE.start_main_~j~0) .cse11 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse8 .cse7 .cse12) (and .cse0 .cse13 .cse2 .cse14) (and (and .cse11 .cse13 .cse15) .cse16 .cse9) (and (or (and .cse1 .cse16 .cse9 .cse15 .cse11 .cse7 .cse12) (and .cse0 .cse1 (<= (div .cse17 (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse2 (<= 14 (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~l~0))) .cse4 .cse5 .cse14 .cse7)) (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse18 3) .cse19))))) [2019-11-15 23:13:42,147 INFO L443 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,147 INFO L439 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_main_~j~0 2)) (.cse12 (* 6 ULTIMATE.start_main_~l~0)) (.cse13 (* 8 ULTIMATE.start_main_~n~0)) (.cse15 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse3 (<= (+ .cse15 2) ULTIMATE.start_main_~n~0)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse12) (+ .cse13 (* 3 ULTIMATE.start_main_~j~0)))) (.cse5 (<= .cse15 ULTIMATE.start_main_~r~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse1 (<= 2 ULTIMATE.start_main_~i~0)) (.cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse19 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse19 1)) (<= 1 .cse19))))) (.cse11 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse16 (<= 1 ULTIMATE.start_main_~r~0)) (.cse17 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ .cse18 1))) (.cse7 (<= ULTIMATE.start_main_~j~0 .cse15))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse5)) .cse10 .cse11 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse12 3) .cse13)) (and .cse14 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse2 .cse3 .cse10 .cse11 .cse5)) (and .cse0 .cse7 (<= .cse15 ULTIMATE.start_main_~j~0) .cse9 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse10 .cse14 .cse5 (<= 2 ULTIMATE.start_main_~j~0)) (and (and .cse2 .cse16 .cse17) .cse0 .cse1 .cse10 .cse4 .cse11) (and (and (<= 1 .cse18) .cse8 .cse9 .cse2 .cse10 .cse16 .cse17) .cse6 .cse7)))) [2019-11-15 23:13:42,147 INFO L443 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,147 INFO L439 ceAbstractionStarter]: At program point L4-11(lines 3 8) the Hoare annotation is: (let ((.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse17 (- ULTIMATE.start_main_~r~0)) (.cse4 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse12 (<= 2 ULTIMATE.start_main_~j~0)) (.cse18 (* 6 ULTIMATE.start_main_~l~0)) (.cse19 (* 8 ULTIMATE.start_main_~n~0))) (let ((.cse8 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse18) (+ .cse19 (* 3 ULTIMATE.start_main_~j~0)))) (.cse13 (and .cse4 .cse1 .cse3 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse12)) (.cse16 (<= (div (+ .cse17 (- 1)) (- 2)) (+ (div ULTIMATE.start_main_~j~0 2) 1))) (.cse9 (<= ULTIMATE.start_main_~j~0 .cse10)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse11 (<= 1 ULTIMATE.start_main_~i~0)) (.cse0 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse5 (<= (+ .cse10 2) ULTIMATE.start_main_~n~0)) (.cse14 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse20 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse20 1)) (<= 1 .cse20))))) (.cse7 (<= .cse10 ULTIMATE.start_main_~r~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0)))) (and .cse0 .cse9 (<= .cse10 ULTIMATE.start_main_~j~0) .cse11 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse8 .cse7 .cse12) (and .cse0 .cse13 .cse2 .cse14) (and (and .cse11 .cse13 .cse15) .cse16 .cse9) (and (or (and .cse1 .cse16 .cse9 .cse15 .cse11 .cse7 .cse12) (and .cse0 .cse1 (<= (div .cse17 (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse2 (<= 14 (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~l~0))) .cse4 .cse5 .cse14 .cse7)) (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse18 3) .cse19))))) [2019-11-15 23:13:42,147 INFO L443 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,148 INFO L439 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~l~0)) (.cse14 (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)))) (let ((.cse5 (div ULTIMATE.start_main_~j~0 2)) (.cse4 (<= .cse14 (+ ULTIMATE.start_main_~l~0 1))) (.cse10 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse11 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse8 (<= 1 ULTIMATE.start_main_~l~0)) (.cse13 (<= .cse3 ULTIMATE.start_main_~r~0))) (let ((.cse0 (and (<= .cse14 (+ .cse5 1)) .cse4 .cse10 .cse11 .cse6 .cse7 .cse8 .cse13)) (.cse1 (* 6 ULTIMATE.start_main_~l~0)) (.cse2 (* 8 ULTIMATE.start_main_~n~0)) (.cse9 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse1 3) .cse2)) (and .cse0 (<= ULTIMATE.start_main_~r~0 .cse3)) (and .cse4 (and (<= 1 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_main_~r~0) .cse11 (<= ULTIMATE.start_main_~l~0 1))) (and (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse1) (+ .cse2 (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse12 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))))) (or (and .cse12 (<= .cse3 ULTIMATE.start_main_~j~0) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse13)) (and .cse12 (<= 2 ULTIMATE.start_main_~i~0) .cse9 .cse10 (<= (+ .cse3 2) ULTIMATE.start_main_~n~0) .cse7 .cse8 .cse13 (<= 2 ULTIMATE.start_main_~j~0))))))))) [2019-11-15 23:13:42,148 INFO L443 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,148 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2019-11-15 23:13:42,148 INFO L439 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (let ((.cse5 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse7 (<= .cse5 ULTIMATE.start_main_~r~0)) (.cse9 (<= .cse5 ULTIMATE.start_main_~j~0)) (.cse0 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0)))) (.cse14 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse13 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse8 (<= 2 ULTIMATE.start_main_~j~0)) (.cse12 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 (let ((.cse11 (* 3 ULTIMATE.start_main_~r~0))) (let ((.cse1 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse10 (and .cse2 .cse3 .cse4 .cse12 (<= 14 (+ .cse11 (* 4 ULTIMATE.start_main_~l~0))) .cse13 .cse6 .cse7))) (or (and (or (and .cse1 .cse2 (<= 2 ULTIMATE.start_main_~i~0) .cse3 .cse4 (<= (+ .cse5 2) ULTIMATE.start_main_~n~0) .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10)) (<= (+ .cse11 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0)))) (and .cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse9 .cse10))))) (and (and (and .cse2 .cse14 .cse4 .cse12 .cse13 .cse6 .cse7) .cse9) .cse0) (and .cse14 (and (and .cse13 (and .cse2 .cse3 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse8) .cse12) .cse4))))) [2019-11-15 23:13:42,148 INFO L443 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,148 INFO L439 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (let ((.cse10 (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2))) (.cse6 (* 2 ULTIMATE.start_main_~l~0)) (.cse8 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse12 (<= 1 ULTIMATE.start_main_~r~0)) (.cse13 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0))) (let ((.cse3 (and (and .cse8 .cse7 .cse12) .cse13)) (.cse5 (<= .cse6 ULTIMATE.start_main_~r~0)) (.cse11 (<= .cse10 (+ ULTIMATE.start_main_~l~0 1))) (.cse2 (<= 1 ULTIMATE.start_main_~i~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0)) (.cse4 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (<= 1 ULTIMATE.start_main_~l~0))) (or (and .cse0 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse1 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))))) (or (and .cse1 (and .cse2 .cse3 .cse4 .cse5) (<= .cse6 ULTIMATE.start_main_~j~0)) (and .cse1 (and .cse7 .cse8) (<= (+ .cse6 2) ULTIMATE.start_main_~n~0) (<= 2 ULTIMATE.start_main_~i~0) .cse4 .cse5 .cse9)))) (and .cse0 (and .cse2 (<= .cse10 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse11 .cse3 .cse4 .cse5)) (and .cse11 (and .cse2 (and (and (and .cse12 (<= ULTIMATE.start_main_~l~0 1) .cse9) .cse13) .cse8 .cse7) .cse4 .cse0))))) [2019-11-15 23:13:42,149 INFO L443 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,149 INFO L439 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= 1 ULTIMATE.start_main_~r~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse11 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse1 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse9 (<= .cse11 ULTIMATE.start_main_~j~0)) (.cse7 (<= .cse11 ULTIMATE.start_main_~r~0)) (.cse8 (and (and .cse0 .cse6 .cse4 (<= (+ ULTIMATE.start_main_~r~0 .cse11) (* 2 ULTIMATE.start_main_~n~0)) .cse2) .cse5)) (.cse3 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 (and (and (and (and .cse2 (<= ULTIMATE.start_main_~l~0 1) .cse3) .cse4) .cse5) .cse6)) (and (and .cse1 .cse7 .cse8) .cse9) (and (let ((.cse12 (* 3 ULTIMATE.start_main_~r~0))) (let ((.cse10 (and (and .cse7 .cse8 (<= 14 (+ .cse12 (* 4 ULTIMATE.start_main_~l~0)))) .cse3))) (or (and (and .cse10 (<= (+ .cse11 2) ULTIMATE.start_main_~n~0)) (<= (+ .cse12 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0)))) (and .cse10 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse9)))) (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))))))) [2019-11-15 23:13:42,149 INFO L443 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,149 INFO L439 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (let ((.cse7 (* 2 ULTIMATE.start_main_~l~0)) (.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))) (let ((.cse1 (<= 2 ULTIMATE.start_main_~j~0)) (.cse0 (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2))) (.cse8 (and (and .cse3 .cse5) .cse4 .cse2)) (.cse9 (<= .cse7 ULTIMATE.start_main_~r~0))) (or (and (<= .cse0 (+ ULTIMATE.start_main_~l~0 1)) (and (and (and (and (and (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) .cse1) .cse2) .cse3) .cse4) .cse5)) (and (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse6 (and (and .cse8 .cse9) .cse1))) (or (and (<= (+ (* 3 ULTIMATE.start_main_~r~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (and .cse6 (<= (+ .cse7 2) ULTIMATE.start_main_~n~0))) (and (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))) .cse6 (<= .cse7 ULTIMATE.start_main_~j~0))))) (and (<= .cse0 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse8 .cse9)))) [2019-11-15 23:13:42,149 INFO L443 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,149 INFO L439 ceAbstractionStarter]: At program point L4-29(lines 3 8) the Hoare annotation is: (let ((.cse1 (* 2 ULTIMATE.start_main_~l~0)) (.cse5 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse6 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= 1 ULTIMATE.start_main_~l~0))) (let ((.cse3 (and .cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse6 .cse7)) (.cse4 (<= .cse1 ULTIMATE.start_main_~r~0)) (.cse2 (<= .cse1 ULTIMATE.start_main_~j~0))) (or (and (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse0 (and (and .cse3 .cse4) (<= 2 ULTIMATE.start_main_~j~0)))) (or (and (<= (+ (* 3 ULTIMATE.start_main_~r~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (and .cse0 (<= (+ .cse1 2) ULTIMATE.start_main_~n~0))) (and (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22))) .cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2)))) (and (and .cse3 (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1)) .cse4) .cse2) (and (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~j~0) (and (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) .cse5 .cse6 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1)) .cse7))))) [2019-11-15 23:13:42,149 INFO L443 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,149 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L439 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (< 1 ULTIMATE.start_main_~l~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (<= 2 ULTIMATE.start_main_~j~0)) [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L439 ceAbstractionStarter]: At program point L4-35(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~r~0) (<= 2 ULTIMATE.start_main_~l~0) (<= 2 ULTIMATE.start_main_~j~0)) [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L439 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~l~0) (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) (<= (+ ULTIMATE.start_main_~l~0 1) ULTIMATE.start_main_~n~0)) [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-11-15 23:13:42,150 INFO L443 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L439 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (let ((.cse1 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse0 (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~l~0) (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1) (<= .cse1 ULTIMATE.start_main_~n~0)))) (or (and .cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) .cse1) .cse0)))) [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L446 ceAbstractionStarter]: At program point L55(lines 10 56) the Hoare annotation is: true [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,151 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse2 (- ULTIMATE.start_main_~r~0))) (let ((.cse27 (div ULTIMATE.start_main_~j~0 2)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse17 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= 1 ULTIMATE.start_main_~l~0)) (.cse24 (<= 1 ULTIMATE.start_main_~r~0)) (.cse25 (<= ULTIMATE.start_main_~l~0 1)) (.cse26 (div (+ .cse2 (- 1)) (- 2))) (.cse3 (+ ULTIMATE.start_main_~l~0 1)) (.cse19 (* 8 ULTIMATE.start_main_~n~0)) (.cse10 (* 2 ULTIMATE.start_main_~l~0)) (.cse29 (* 3 ULTIMATE.start_main_~j~0))) (let ((.cse0 (<= (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~i~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) .cse29))) (.cse6 (<= (+ .cse10 2) ULTIMATE.start_main_~n~0)) (.cse15 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ .cse19 .cse29))) (.cse8 (<= .cse10 ULTIMATE.start_main_~r~0)) (.cse12 (exists ((v_ULTIMATE.start_main_~j~0_22 Int)) (and (<= (div (- v_ULTIMATE.start_main_~j~0_22) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) (<= ULTIMATE.start_main_~i~0 v_ULTIMATE.start_main_~j~0_22)))) (.cse4 (<= 2 ULTIMATE.start_main_~i~0)) (.cse18 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= .cse26 .cse3)) (.cse23 (and (<= 1 .cse27) .cse1 .cse17 .cse7 .cse24 .cse25 (<= .cse3 ULTIMATE.start_main_~n~0))) (.cse11 (exists ((v_ULTIMATE.start_main_~j~0_20 Int)) (let ((.cse28 (div v_ULTIMATE.start_main_~j~0_20 2))) (and (<= (* 2 v_ULTIMATE.start_main_~j~0_20) ULTIMATE.start_main_~j~0) (<= 1 .cse28) (<= (div (+ (- ULTIMATE.start_main_~r~0) (- 1)) (- 2)) (+ .cse28 1)))))) (.cse20 (<= .cse26 (+ .cse27 1))) (.cse13 (<= ULTIMATE.start_main_~j~0 .cse10)) (.cse21 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse14 (<= 1 ULTIMATE.start_main_~i~0)) (.cse16 (<= 2 ULTIMATE.start_main_~j~0))) (or (or (and .cse0 .cse1 (<= (div .cse2 (- 2)) .cse3) .cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse5 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse5 1)) (<= 1 .cse5) (<= (+ v_ULTIMATE.start_main_~j~0_23 1) (div ULTIMATE.start_main_~j~0 2))))) .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse4 (<= (+ ULTIMATE.start_main_~r~0 .cse10) (* 2 ULTIMATE.start_main_~n~0)) .cse7 .cse11 .cse8)) (and .cse12 .cse1 .cse13 (<= .cse10 ULTIMATE.start_main_~j~0) .cse14 .cse15 .cse8 .cse16) (and (or (and .cse0 .cse1 .cse4 .cse17 .cse6 .cse7 .cse8) (and .cse12 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8)) .cse15 (exists ((v_ULTIMATE.start_main_~j~0_25 Int)) (and (<= 1 (div v_ULTIMATE.start_main_~j~0_25 2)) (<= (* 2 v_ULTIMATE.start_main_~j~0_25) ULTIMATE.start_main_~j~0))) (<= (+ (* 5 ULTIMATE.start_main_~r~0) 23) (+ (* 8 ULTIMATE.start_main_~l~0) .cse19))) (and .cse20 .cse13 .cse21 .cse14 .cse15 .cse8 .cse16) (and .cse12 .cse4 .cse18 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse22 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (+ v_ULTIMATE.start_main_~j~0_23 1) ULTIMATE.start_main_~j~0) (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse22 1)) (<= 1 .cse22)))) .cse23) (and .cse9 .cse23 .cse11) (and .cse1 .cse20 .cse13 (and .cse17 .cse21 (and .cse14 (and .cse24 .cse25 .cse16)))))))) [2019-11-15 23:13:42,151 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 25 32) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,152 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-15 23:13:42,153 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-11-15 23:13:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,183 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:13:42 BoogieIcfgContainer [2019-11-15 23:13:42,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:13:42,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:13:42,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:13:42,254 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:13:42,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:34" (3/4) ... [2019-11-15 23:13:42,258 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:13:42,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-15 23:13:42,271 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:13:42,271 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:13:42,297 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (-r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1 && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2) && v_ULTIMATE.start_main_~j~0_23 + 1 <= j / 2)) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || ((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && 2 <= i) && r + 2 * l <= 2 * n) && 1 <= l) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && 2 * l <= r)) || ((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && 5 * r + 23 <= 8 * l + 8 * n)) || (((((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n)) || (((-r + -1) / -2 <= l + 1 && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1))) || (((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && (r <= n && i + 1 <= n) && 1 <= i && (1 <= r && l <= 1) && 2 <= j) [2019-11-15 23:13:42,298 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) [2019-11-15 23:13:42,298 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && 5 * r + 6 * l + 3 <= 8 * n) || (((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && r <= 2 * l)) || ((-r + -1) / -2 <= l + 1 && (((((((1 <= j / 2 && 1 <= i) && 1 == cond) && 1 <= l) && r <= n) && j <= n) && 1 <= r) && i + 1 <= n) && l <= 1)) || (8 * r + 6 * l <= 8 * n + 3 * j && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((r <= n && j <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r) && 2 <= j))) [2019-11-15 23:13:42,299 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) [2019-11-15 23:13:42,299 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((8 * r + 6 * l <= 8 * n + 3 * j && ((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r)) && 3 * r + 10 <= 4 * n + 2 * j) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 1 == cond) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r))) || ((((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 <= l) && 2 * l <= r) && 2 * l <= j) && 8 * r + 6 * l <= 8 * n + 3 * j)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((!(0 == cond) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && j <= n) [2019-11-15 23:13:42,299 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) [2019-11-15 23:13:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) [2019-11-15 23:13:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= l && 8 * r + 6 * l <= 8 * n + 3 * j) && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((1 <= i && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r) && 2 * l <= j) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= n && r <= n) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && 2 * l <= r) && 2 <= j))) || (1 <= l && ((((1 <= i && (-r + -1) / -2 <= j / 2 + 1) && (-r + -1) / -2 <= l + 1) && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((1 <= r && l <= 1) && 2 <= j) && i + 1 <= n) && r <= n) && j <= n) && 1 == cond) && 1 <= l) [2019-11-15 23:13:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == cond) && (-r + -1) / -2 <= l + 1) && ((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 <= l) && r <= n) || ((((-r + -1) / -2 <= l + 1 && 2 * l <= r) && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 2 * l <= j)) || (((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && 2 * l + 2 <= n) && 3 * r + 10 <= 4 * n + 2 * j) || ((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 1 == cond) && 2 * l <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) [2019-11-15 23:13:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((-r + -1) / -2 <= l + 1 && (((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 == cond) && r <= n) && 1 <= l) || (8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l <= j)))) || (((-r + -1) / -2 <= j / 2 + 1 && ((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) [2019-11-15 23:13:42,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 1 == cond) && 2 * l <= j))) || ((((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && (-r + -1) / -2 <= l + 1) && 2 * l <= r) && 2 * l <= j)) || (r <= j && ((((1 <= j / 2 && !(0 == cond)) && j <= n) && 1 <= r) && l <= 1) && 1 <= l) [2019-11-15 23:13:42,321 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_336a76c6-fa1c-4ba0-b886-50b4875ebf1a/bin/uautomizer/witness.graphml [2019-11-15 23:13:42,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:13:42,323 INFO L168 Benchmark]: Toolchain (without parser) took 68564.26 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 740.3 MB). Free memory was 944.8 MB in the beginning and 952.4 MB in the end (delta: -7.6 MB). Peak memory consumption was 732.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:13:42,323 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:13:42,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:13:42,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:13:42,324 INFO L168 Benchmark]: Boogie Preprocessor took 23.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:13:42,324 INFO L168 Benchmark]: RCFGBuilder took 336.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:13:42,325 INFO L168 Benchmark]: TraceAbstraction took 67798.51 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 598.2 MB). Free memory was 1.1 GB in the beginning and 977.0 MB in the end (delta: 126.6 MB). Peak memory consumption was 855.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:13:42,325 INFO L168 Benchmark]: Witness Printer took 67.75 ms. Allocated memory is still 1.8 GB. Free memory was 977.0 MB in the beginning and 952.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:13:42,327 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 336.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67798.51 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 598.2 MB). Free memory was 1.1 GB in the beginning and 977.0 MB in the end (delta: 126.6 MB). Peak memory consumption was 855.5 MB. Max. memory is 11.5 GB. * Witness Printer took 67.75 ms. Allocated memory is still 1.8 GB. Free memory was 977.0 MB in the beginning and 952.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((1 <= l && 8 * r + 6 * l <= 8 * n + 3 * j) && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((1 <= i && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r) && 2 * l <= j) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= n && r <= n) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && 2 * l <= r) && 2 <= j))) || (1 <= l && ((((1 <= i && (-r + -1) / -2 <= j / 2 + 1) && (-r + -1) / -2 <= l + 1) && ((r <= n && j <= n) && 1 <= r) && i + 1 <= n) && 1 == cond) && 2 * l <= r)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((1 <= r && l <= 1) && 2 <= j) && i + 1 <= n) && r <= n) && j <= n) && 1 == cond) && 1 <= l) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) && 1 == cond) || ((-r + -1) / -2 <= l + 1 && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: ((8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) && 1 == cond) && 2 * l <= j))) || ((((((!(0 == cond) && r <= n) && j <= n) && 1 <= l) && (-r + -1) / -2 <= l + 1) && 2 * l <= r) && 2 * l <= j)) || (r <= j && ((((1 <= j / 2 && !(0 == cond)) && j <= n) && 1 <= r) && l <= 1) && 1 <= l) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: ((8 * r + 6 * l <= 8 * n + 3 * j && ((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r)) && 3 * r + 10 <= 4 * n + 2 * j) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 1 == cond) && 2 * l <= j) && ((((((!(0 == cond) && r <= n) && j <= n) && i + 1 <= n) && 14 <= 3 * r + 4 * l) && 1 <= i) && 1 <= l) && 2 * l <= r))) || ((((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 <= l) && 2 * l <= r) && 2 * l <= j) && 8 * r + 6 * l <= 8 * n + 3 * j)) || ((-r + -1) / -2 <= l + 1 && ((1 <= i && ((((!(0 == cond) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && j <= n) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((-r + -1) / -2 <= l + 1 && (((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 == cond) && r <= n) && 1 <= l) || (8 * r + 6 * l <= 8 * n + 3 * j && ((3 * r + 10 <= 4 * n + 2 * j && (((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l + 2 <= n) || (((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && ((((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) && 2 <= j) && 2 * l <= j)))) || (((-r + -1) / -2 <= j / 2 + 1 && ((1 == cond && 1 <= l) && r <= n) && j <= n) && 2 * l <= r) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && 5 * r + 6 * l + 3 <= 8 * n) || (((((((((-r + -1) / -2 <= j / 2 + 1 && (-r + -1) / -2 <= l + 1) && j <= n) && i + 1 <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) && r <= 2 * l)) || ((-r + -1) / -2 <= l + 1 && (((((((1 <= j / 2 && 1 <= i) && 1 == cond) && 1 <= l) && r <= n) && j <= n) && 1 <= r) && i + 1 <= n) && l <= 1)) || (8 * r + 6 * l <= 8 * n + 3 * j && ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 * l <= j) && ((((r <= n && j <= n) && 1 <= i) && 1 == cond) && 1 <= l) && 2 * l <= r) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r) && 2 <= j))) - InvariantResult [Line: 24]: Loop Invariant [2019-11-15 23:13:42,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-11-15 23:13:42,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] Derived loop invariant: (((((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (-r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1 && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2) && v_ULTIMATE.start_main_~j~0_23 + 1 <= j / 2)) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || ((((((!(0 == cond) && (-r + -1) / -2 <= l + 1) && 2 <= i) && r + 2 * l <= 2 * n) && 1 <= l) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && 2 * l <= r)) || ((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) || (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && 5 * r + 23 <= 8 * l + 8 * n)) || (((((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n)) || (((-r + -1) / -2 <= l + 1 && (((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) && (\exists v_ULTIMATE.start_main_~j~0_20 : int :: (2 * v_ULTIMATE.start_main_~j~0_20 <= j && 1 <= v_ULTIMATE.start_main_~j~0_20 / 2) && (-r + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1))) || (((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && (r <= n && i + 1 <= n) && 1 <= i && (1 <= r && l <= 1) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((!(0 == cond) && r <= n) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= l) && 2 <= j - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r) || (((((-r + -1) / -2 <= j / 2 + 1 && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n) || ((8 * r + 6 * l <= 8 * n + 3 * j && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) && (((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 == cond) && 1 <= l) && 2 * l <= r)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || (((((((j + 1 <= n && 1 <= r) && l <= 1) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 2 <= i) && 1 == cond) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 1 <= l)) || ((((((((1 <= j / 2 && i + 1 <= n) && 1 <= i) && j + 1 <= n) && 1 == cond) && 1 <= r) && l <= 1) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: (((!(0 == cond) && (-r + -1) / -2 <= l + 1) && ((((1 <= r && l <= 1) && 2 <= j) && j <= n) && 1 <= l) && r <= n) || ((((-r + -1) / -2 <= l + 1 && 2 * l <= r) && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 2 * l <= j)) || (((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && 2 * l + 2 <= n) && 3 * r + 10 <= 4 * n + 2 * j) || ((((((2 * l <= r && ((((!(0 == cond) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= r) && 1 <= l) && 14 <= 3 * r + 4 * l) && 2 <= j) && (\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22)) && 1 == cond) && 2 * l <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) - InvariantResult [Line: 3]: Loop Invariant [2019-11-15 23:13:42,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-11-15 23:13:42,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-11-15 23:13:42,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-11-15 23:13:42,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && 2 <= i) && r <= n) && j + 1 <= n) && 2 * l + 2 <= n) && 1 <= l) && 2 * l <= r) && 8 * r + 6 * l <= 8 * n + 3 * j) && (\exists v_ULTIMATE.start_main_~j~0_25 : int :: 1 <= v_ULTIMATE.start_main_~j~0_25 / 2 && 2 * v_ULTIMATE.start_main_~j~0_25 <= j)) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && j <= 2 * l) && 2 * l <= j) && 1 <= i) && -j / -2 <= (n + -2) / 2) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && 2 <= i) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2))) || ((((1 <= i && (((((j + 1 <= n && !(0 == cond)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && 2 <= j) && i + 1 <= n) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l)) || ((((((((!(0 == cond) && (-r + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 1 <= i) && 2 * l <= r) && 2 <= j) || (((((((((\exists v_ULTIMATE.start_main_~j~0_22 : int :: -v_ULTIMATE.start_main_~j~0_22 / -2 <= (n + -2) / 2 && i <= v_ULTIMATE.start_main_~j~0_22) && !(0 == cond)) && -r / -2 <= l + 1) && 2 <= i) && 14 <= 3 * r + 4 * l) && j + 1 <= n) && 2 * l + 2 <= n) && (\exists v_ULTIMATE.start_main_~j~0_23 : int :: (v_ULTIMATE.start_main_~j~0_23 + 1 <= j && -r / -2 <= v_ULTIMATE.start_main_~j~0_23 / 2 + 1) && 1 <= v_ULTIMATE.start_main_~j~0_23 / 2)) && 2 * l <= r)) && 5 * r + 6 * l + 3 <= 8 * n) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((1 < l && 1 == cond) && r <= n) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 14 error locations. Result: SAFE, OverallTime: 67.6s, OverallIterations: 20, TraceHistogramMax: 4, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.7s, HoareTripleCheckerStatistics: 1127 SDtfs, 4851 SDslu, 3350 SDs, 0 SdLazy, 6724 SolverSat, 3064 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 355 SyntacticMatches, 4 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13831 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1930 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 675 NumberOfFragments, 3553 HoareAnnotationTreeSize, 16 FomulaSimplifications, 916295071 FormulaSimplificationTreeSizeReduction, 6.2s HoareSimplificationTime, 16 FomulaSimplificationsInter, 128391470 FormulaSimplificationTreeSizeReductionInter, 34.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 823 ConstructedInterpolants, 62 QuantifiedInterpolants, 331598 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1039 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 140/394 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...