./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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.25-f470102 [2019-12-07 15:47:48,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:47:48,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:47:48,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:47:48,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:47:48,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:47:48,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:47:48,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:47:48,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:47:48,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:47:48,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:47:48,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:47:48,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:47:48,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:47:48,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:47:48,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:47:48,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:47:48,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:47:48,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:47:48,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:47:48,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:47:48,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:47:48,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:47:48,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:47:48,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:47:48,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:47:48,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:47:48,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:47:48,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:47:48,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:47:48,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:47:48,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:47:48,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:47:48,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:47:48,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:47:48,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:47:48,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:47:48,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:47:48,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:47:48,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:47:48,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:47:48,729 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:47:48,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:47:48,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:47:48,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:47:48,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:47:48,740 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:47:48,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:47:48,740 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:47:48,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:47:48,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:47:48,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:47:48,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:47:48,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:47:48,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:47:48,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:47:48,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:47:48,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:47:48,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:47:48,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:47:48,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:47:48,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:47:48,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:47:48,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:47:48,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:47:48,743 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_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:48,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:47:48,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:47:48,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:47:48,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:47:48,858 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:47:48,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-12-07 15:47:48,900 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/data/1e2b45f7b/1bdae5fa39a643e0a9dcc179a8d6055b/FLAG4d667af51 [2019-12-07 15:47:49,305 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:47:49,306 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/sv-benchmarks/c/loop-invgen/heapsort.i [2019-12-07 15:47:49,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/data/1e2b45f7b/1bdae5fa39a643e0a9dcc179a8d6055b/FLAG4d667af51 [2019-12-07 15:47:49,318 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/data/1e2b45f7b/1bdae5fa39a643e0a9dcc179a8d6055b [2019-12-07 15:47:49,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:47:49,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:47:49,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:47:49,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:47:49,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:47:49,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ba0c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49, skipping insertion in model container [2019-12-07 15:47:49,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:47:49,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:47:49,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:47:49,445 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:47:49,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:47:49,497 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:47:49,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49 WrapperNode [2019-12-07 15:47:49,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:47:49,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:47:49,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:47:49,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:47:49,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:47:49,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:47:49,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:47:49,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:47:49,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... [2019-12-07 15:47:49,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:47:49,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:47:49,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:47:49,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:47:49,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:47:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:47:49,761 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:47:49,761 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-12-07 15:47:49,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:47:49 BoogieIcfgContainer [2019-12-07 15:47:49,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:47:49,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:47:49,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:47:49,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:47:49,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:47:49" (1/3) ... [2019-12-07 15:47:49,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b91a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:47:49, skipping insertion in model container [2019-12-07 15:47:49,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:49" (2/3) ... [2019-12-07 15:47:49,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b91a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:47:49, skipping insertion in model container [2019-12-07 15:47:49,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:47:49" (3/3) ... [2019-12-07 15:47:49,767 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-12-07 15:47:49,773 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:47:49,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-12-07 15:47:49,784 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-12-07 15:47:49,799 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:47:49,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:47:49,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:47:49,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:47:49,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:47:49,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:47:49,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:47:49,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:47:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-12-07 15:47:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:47:49,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:49,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:49,817 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1242509755, now seen corresponding path program 1 times [2019-12-07 15:47:49,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:49,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692857500] [2019-12-07 15:47:49,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:49,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692857500] [2019-12-07 15:47:49,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:49,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65382601] [2019-12-07 15:47:49,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:49,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:49,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:49,950 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-12-07 15:47:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,027 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2019-12-07 15:47:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:50,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 15:47:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,035 INFO L225 Difference]: With dead ends: 144 [2019-12-07 15:47:50,035 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 15:47:50,038 INFO L630 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-12-07 15:47:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 15:47:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-12-07 15:47:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 15:47:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-12-07 15:47:50,065 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2019-12-07 15:47:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,065 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-12-07 15:47:50,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-12-07 15:47:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:47:50,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,067 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1242533587, now seen corresponding path program 1 times [2019-12-07 15:47:50,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572145853] [2019-12-07 15:47:50,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:50,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572145853] [2019-12-07 15:47:50,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:47:50,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580046172] [2019-12-07 15:47:50,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:50,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:50,100 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2019-12-07 15:47:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,168 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-12-07 15:47:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:50,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 15:47:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,170 INFO L225 Difference]: With dead ends: 71 [2019-12-07 15:47:50,170 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 15:47:50,170 INFO L630 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-12-07 15:47:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 15:47:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2019-12-07 15:47:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 15:47:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-12-07 15:47:50,177 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2019-12-07 15:47:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,177 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-12-07 15:47:50,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-12-07 15:47:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:47:50,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,178 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1242439254, now seen corresponding path program 1 times [2019-12-07 15:47:50,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791386] [2019-12-07 15:47:50,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:50,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791386] [2019-12-07 15:47:50,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:47:50,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785498546] [2019-12-07 15:47:50,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:50,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:50,215 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2019-12-07 15:47:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,334 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2019-12-07 15:47:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:47:50,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 15:47:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,336 INFO L225 Difference]: With dead ends: 127 [2019-12-07 15:47:50,336 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 15:47:50,337 INFO L630 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-12-07 15:47:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 15:47:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2019-12-07 15:47:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 15:47:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-12-07 15:47:50,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 8 [2019-12-07 15:47:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,350 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-12-07 15:47:50,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-12-07 15:47:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:47:50,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,352 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash 51126654, now seen corresponding path program 1 times [2019-12-07 15:47:50,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945502039] [2019-12-07 15:47:50,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:50,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945502039] [2019-12-07 15:47:50,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:47:50,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449034079] [2019-12-07 15:47:50,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:50,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:50,397 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 6 states. [2019-12-07 15:47:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,547 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-12-07 15:47:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:47:50,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 15:47:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,549 INFO L225 Difference]: With dead ends: 155 [2019-12-07 15:47:50,549 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 15:47:50,550 INFO L630 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-12-07 15:47:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 15:47:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2019-12-07 15:47:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 15:47:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-12-07 15:47:50,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 10 [2019-12-07 15:47:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,566 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-12-07 15:47:50,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-12-07 15:47:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:47:50,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,567 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash 74029974, now seen corresponding path program 1 times [2019-12-07 15:47:50,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138116346] [2019-12-07 15:47:50,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:50,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138116346] [2019-12-07 15:47:50,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:47:50,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198483488] [2019-12-07 15:47:50,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:50,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:50,596 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 4 states. [2019-12-07 15:47:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,658 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2019-12-07 15:47:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:47:50,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 15:47:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,659 INFO L225 Difference]: With dead ends: 137 [2019-12-07 15:47:50,659 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 15:47:50,659 INFO L630 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-12-07 15:47:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 15:47:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2019-12-07 15:47:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 15:47:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2019-12-07 15:47:50,669 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 10 [2019-12-07 15:47:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,669 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2019-12-07 15:47:50,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2019-12-07 15:47:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:47:50,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash -16628999, now seen corresponding path program 1 times [2019-12-07 15:47:50,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850361396] [2019-12-07 15:47:50,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,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-12-07 15:47:50,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850361396] [2019-12-07 15:47:50,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:47:50,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725071789] [2019-12-07 15:47:50,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:50,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:50,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:50,699 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 5 states. [2019-12-07 15:47:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,813 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2019-12-07 15:47:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:47:50,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 15:47:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,815 INFO L225 Difference]: With dead ends: 216 [2019-12-07 15:47:50,815 INFO L226 Difference]: Without dead ends: 208 [2019-12-07 15:47:50,816 INFO L630 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-12-07 15:47:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-07 15:47:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 160. [2019-12-07 15:47:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-12-07 15:47:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2019-12-07 15:47:50,829 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 10 [2019-12-07 15:47:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,829 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2019-12-07 15:47:50,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2019-12-07 15:47:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:47:50,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,830 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,831 INFO L82 PathProgramCache]: Analyzing trace with hash -758219972, now seen corresponding path program 1 times [2019-12-07 15:47:50,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645156356] [2019-12-07 15:47:50,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:50,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645156356] [2019-12-07 15:47:50,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:50,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223695255] [2019-12-07 15:47:50,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:50,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:50,845 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand 3 states. [2019-12-07 15:47:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:50,864 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2019-12-07 15:47:50,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:50,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 15:47:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:50,866 INFO L225 Difference]: With dead ends: 320 [2019-12-07 15:47:50,866 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 15:47:50,867 INFO L630 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-12-07 15:47:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 15:47:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 191. [2019-12-07 15:47:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-12-07 15:47:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2019-12-07 15:47:50,879 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 10 [2019-12-07 15:47:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:50,879 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2019-12-07 15:47:50,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2019-12-07 15:47:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:47:50,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:50,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:50,880 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1017268915, now seen corresponding path program 1 times [2019-12-07 15:47:50,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:50,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212173175] [2019-12-07 15:47:50,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:50,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212173175] [2019-12-07 15:47:50,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:50,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:47:50,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227398747] [2019-12-07 15:47:50,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:50,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:50,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:50,904 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand 5 states. [2019-12-07 15:47:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:51,013 INFO L93 Difference]: Finished difference Result 287 states and 363 transitions. [2019-12-07 15:47:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:47:51,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 15:47:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:51,015 INFO L225 Difference]: With dead ends: 287 [2019-12-07 15:47:51,015 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 15:47:51,020 INFO L630 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-12-07 15:47:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 15:47:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2019-12-07 15:47:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-12-07 15:47:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2019-12-07 15:47:51,030 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 11 [2019-12-07 15:47:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:51,030 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2019-12-07 15:47:51,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2019-12-07 15:47:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:47:51,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:51,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:51,032 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash 173914847, now seen corresponding path program 1 times [2019-12-07 15:47:51,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:51,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130073734] [2019-12-07 15:47:51,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:51,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130073734] [2019-12-07 15:47:51,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:51,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:47:51,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775872351] [2019-12-07 15:47:51,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:51,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:51,065 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand 5 states. [2019-12-07 15:47:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:51,163 INFO L93 Difference]: Finished difference Result 302 states and 371 transitions. [2019-12-07 15:47:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:47:51,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 15:47:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:51,165 INFO L225 Difference]: With dead ends: 302 [2019-12-07 15:47:51,165 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 15:47:51,166 INFO L630 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-12-07 15:47:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 15:47:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 241. [2019-12-07 15:47:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 15:47:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 304 transitions. [2019-12-07 15:47:51,176 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 304 transitions. Word has length 14 [2019-12-07 15:47:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:51,176 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 304 transitions. [2019-12-07 15:47:51,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2019-12-07 15:47:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:47:51,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:51,177 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:51,177 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1061608090, now seen corresponding path program 1 times [2019-12-07 15:47:51,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:51,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21524082] [2019-12-07 15:47:51,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:51,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21524082] [2019-12-07 15:47:51,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688193262] [2019-12-07 15:47:51,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:51,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 15:47:51,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:47:51,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:47:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:51,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:47:51,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-12-07 15:47:51,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002393086] [2019-12-07 15:47:51,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:51,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:47:51,290 INFO L87 Difference]: Start difference. First operand 241 states and 304 transitions. Second operand 6 states. [2019-12-07 15:47:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:51,397 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2019-12-07 15:47:51,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:47:51,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 15:47:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:51,399 INFO L225 Difference]: With dead ends: 242 [2019-12-07 15:47:51,400 INFO L226 Difference]: Without dead ends: 234 [2019-12-07 15:47:51,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:47:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-07 15:47:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-12-07 15:47:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 15:47:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2019-12-07 15:47:51,419 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 15 [2019-12-07 15:47:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:51,419 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2019-12-07 15:47:51,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2019-12-07 15:47:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:47:51,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:51,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:51,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:47:51,622 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash -371397790, now seen corresponding path program 1 times [2019-12-07 15:47:51,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:51,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044728450] [2019-12-07 15:47:51,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:51,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044728450] [2019-12-07 15:47:51,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:51,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:47:51,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200741556] [2019-12-07 15:47:51,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:51,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:51,707 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand 6 states. [2019-12-07 15:47:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:52,063 INFO L93 Difference]: Finished difference Result 446 states and 543 transitions. [2019-12-07 15:47:52,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:47:52,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 15:47:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:52,065 INFO L225 Difference]: With dead ends: 446 [2019-12-07 15:47:52,065 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 15:47:52,066 INFO L630 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-12-07 15:47:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 15:47:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 368. [2019-12-07 15:47:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-12-07 15:47:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 456 transitions. [2019-12-07 15:47:52,083 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 456 transitions. Word has length 16 [2019-12-07 15:47:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:52,083 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 456 transitions. [2019-12-07 15:47:52,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 456 transitions. [2019-12-07 15:47:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:47:52,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:52,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:52,084 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1382515040, now seen corresponding path program 1 times [2019-12-07 15:47:52,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:52,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293087359] [2019-12-07 15:47:52,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:52,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293087359] [2019-12-07 15:47:52,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:52,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:47:52,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74992908] [2019-12-07 15:47:52,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:52,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:52,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:52,111 INFO L87 Difference]: Start difference. First operand 368 states and 456 transitions. Second operand 6 states. [2019-12-07 15:47:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:52,267 INFO L93 Difference]: Finished difference Result 408 states and 495 transitions. [2019-12-07 15:47:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:47:52,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 15:47:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:52,269 INFO L225 Difference]: With dead ends: 408 [2019-12-07 15:47:52,270 INFO L226 Difference]: Without dead ends: 406 [2019-12-07 15:47:52,270 INFO L630 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-12-07 15:47:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-07 15:47:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 299. [2019-12-07 15:47:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 15:47:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 370 transitions. [2019-12-07 15:47:52,282 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 370 transitions. Word has length 16 [2019-12-07 15:47:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:52,283 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 370 transitions. [2019-12-07 15:47:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 370 transitions. [2019-12-07 15:47:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:47:52,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:52,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:52,283 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1085410132, now seen corresponding path program 1 times [2019-12-07 15:47:52,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:52,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63383222] [2019-12-07 15:47:52,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:52,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63383222] [2019-12-07 15:47:52,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:52,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:47:52,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660292643] [2019-12-07 15:47:52,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:52,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:52,311 INFO L87 Difference]: Start difference. First operand 299 states and 370 transitions. Second operand 6 states. [2019-12-07 15:47:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:52,455 INFO L93 Difference]: Finished difference Result 439 states and 533 transitions. [2019-12-07 15:47:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:47:52,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 15:47:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:52,458 INFO L225 Difference]: With dead ends: 439 [2019-12-07 15:47:52,458 INFO L226 Difference]: Without dead ends: 435 [2019-12-07 15:47:52,459 INFO L630 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-12-07 15:47:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-07 15:47:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 207. [2019-12-07 15:47:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 15:47:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2019-12-07 15:47:52,475 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 20 [2019-12-07 15:47:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:52,476 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2019-12-07 15:47:52,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2019-12-07 15:47:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:47:52,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:52,476 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:52,477 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1447113763, now seen corresponding path program 1 times [2019-12-07 15:47:52,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:52,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722619377] [2019-12-07 15:47:52,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722619377] [2019-12-07 15:47:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135454284] [2019-12-07 15:47:52,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:52,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 15:47:52,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:47:52,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:47:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:52,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:47:52,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-12-07 15:47:52,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872434904] [2019-12-07 15:47:52,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:52,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:52,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:47:52,565 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand 6 states. [2019-12-07 15:47:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:52,657 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2019-12-07 15:47:52,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:47:52,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 15:47:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:52,659 INFO L225 Difference]: With dead ends: 248 [2019-12-07 15:47:52,659 INFO L226 Difference]: Without dead ends: 246 [2019-12-07 15:47:52,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:47:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-07 15:47:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 109. [2019-12-07 15:47:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 15:47:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-12-07 15:47:52,671 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 21 [2019-12-07 15:47:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:52,671 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-12-07 15:47:52,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-12-07 15:47:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 15:47:52,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:52,672 INFO L410 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-12-07 15:47:52,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:47:52,873 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1066677303, now seen corresponding path program 1 times [2019-12-07 15:47:52,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:52,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112385499] [2019-12-07 15:47:52,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:52,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112385499] [2019-12-07 15:47:52,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693575718] [2019-12-07 15:47:52,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:52,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:47:52,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:47:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:52,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:47:52,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-12-07 15:47:52,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047368564] [2019-12-07 15:47:52,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:52,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:52,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:47:52,992 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 6 states. [2019-12-07 15:47:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:53,141 INFO L93 Difference]: Finished difference Result 399 states and 467 transitions. [2019-12-07 15:47:53,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:47:53,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 15:47:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:53,143 INFO L225 Difference]: With dead ends: 399 [2019-12-07 15:47:53,143 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 15:47:53,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:47:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 15:47:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 255. [2019-12-07 15:47:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 15:47:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2019-12-07 15:47:53,162 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 30 [2019-12-07 15:47:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:53,162 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2019-12-07 15:47:53,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2019-12-07 15:47:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:47:53,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:53,163 INFO L410 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-12-07 15:47:53,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:47:53,364 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 478455163, now seen corresponding path program 1 times [2019-12-07 15:47:53,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:53,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483847931] [2019-12-07 15:47:53,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:53,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483847931] [2019-12-07 15:47:53,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732620753] [2019-12-07 15:47:53,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:53,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:47:53,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:47:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:53,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:47:53,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-12-07 15:47:53,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561751079] [2019-12-07 15:47:53,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 15:47:53,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:53,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 15:47:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 15:47:53,597 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand 18 states. [2019-12-07 15:47:55,494 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 15:47:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:58,267 INFO L93 Difference]: Finished difference Result 936 states and 1063 transitions. [2019-12-07 15:47:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-07 15:47:58,267 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-12-07 15:47:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:58,270 INFO L225 Difference]: With dead ends: 936 [2019-12-07 15:47:58,270 INFO L226 Difference]: Without dead ends: 391 [2019-12-07 15:47:58,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1395, Invalid=8307, Unknown=0, NotChecked=0, Total=9702 [2019-12-07 15:47:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-07 15:47:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 152. [2019-12-07 15:47:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 15:47:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2019-12-07 15:47:58,290 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 37 [2019-12-07 15:47:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:58,290 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2019-12-07 15:47:58,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 15:47:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2019-12-07 15:47:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:47:58,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:58,291 INFO L410 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-12-07 15:47:58,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:47:58,492 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1811445003, now seen corresponding path program 1 times [2019-12-07 15:47:58,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:58,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67004776] [2019-12-07 15:47:58,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:58,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67004776] [2019-12-07 15:47:58,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293771726] [2019-12-07 15:47:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:58,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:47:58,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:47:58,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:47:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:58,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:47:58,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 15:47:58,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905589078] [2019-12-07 15:47:58,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:47:58,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:47:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:47:58,599 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand 8 states. [2019-12-07 15:47:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:58,781 INFO L93 Difference]: Finished difference Result 176 states and 200 transitions. [2019-12-07 15:47:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 15:47:58,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-07 15:47:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:58,783 INFO L225 Difference]: With dead ends: 176 [2019-12-07 15:47:58,783 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 15:47:58,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:47:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 15:47:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2019-12-07 15:47:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 15:47:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2019-12-07 15:47:58,805 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 53 [2019-12-07 15:47:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:58,805 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2019-12-07 15:47:58,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:47:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2019-12-07 15:47:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:47:58,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:58,806 INFO L410 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-12-07 15:47:59,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:47:59,007 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1337051790, now seen corresponding path program 1 times [2019-12-07 15:47:59,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:59,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341004891] [2019-12-07 15:47:59,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:59,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341004891] [2019-12-07 15:47:59,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163588004] [2019-12-07 15:47:59,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:47:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:59,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 15:47:59,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:47:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:47:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:59,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:47:59,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-12-07 15:47:59,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180889840] [2019-12-07 15:47:59,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:47:59,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:47:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:47:59,310 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand 13 states. [2019-12-07 15:47:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:59,844 INFO L93 Difference]: Finished difference Result 321 states and 360 transitions. [2019-12-07 15:47:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:47:59,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-07 15:47:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:59,846 INFO L225 Difference]: With dead ends: 321 [2019-12-07 15:47:59,846 INFO L226 Difference]: Without dead ends: 319 [2019-12-07 15:47:59,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=736, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:47:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-12-07 15:47:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2019-12-07 15:47:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-07 15:47:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2019-12-07 15:47:59,867 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 55 [2019-12-07 15:47:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:59,867 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2019-12-07 15:47:59,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:47:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2019-12-07 15:47:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:47:59,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:59,868 INFO L410 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-12-07 15:48:00,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:48:00,069 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:00,070 INFO L82 PathProgramCache]: Analyzing trace with hash -586176244, now seen corresponding path program 1 times [2019-12-07 15:48:00,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:00,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979878830] [2019-12-07 15:48:00,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:00,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979878830] [2019-12-07 15:48:00,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888620373] [2019-12-07 15:48:00,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:48:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:00,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 15:48:00,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:48:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:00,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:48:00,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-12-07 15:48:00,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326377099] [2019-12-07 15:48:00,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 15:48:00,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:00,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 15:48:00,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 15:48:00,301 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 18 states. [2019-12-07 15:48:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:07,233 INFO L93 Difference]: Finished difference Result 1647 states and 1835 transitions. [2019-12-07 15:48:07,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-12-07 15:48:07,233 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-07 15:48:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:07,236 INFO L225 Difference]: With dead ends: 1647 [2019-12-07 15:48:07,237 INFO L226 Difference]: Without dead ends: 953 [2019-12-07 15:48:07,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7752 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3202, Invalid=17104, Unknown=0, NotChecked=0, Total=20306 [2019-12-07 15:48:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-07 15:48:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 316. [2019-12-07 15:48:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-12-07 15:48:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 357 transitions. [2019-12-07 15:48:07,277 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 357 transitions. Word has length 55 [2019-12-07 15:48:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:07,277 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 357 transitions. [2019-12-07 15:48:07,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 15:48:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 357 transitions. [2019-12-07 15:48:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 15:48:07,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:07,278 INFO L410 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-12-07 15:48:07,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:48:07,479 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2004720992, now seen corresponding path program 2 times [2019-12-07 15:48:07,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:07,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082948305] [2019-12-07 15:48:07,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:07,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082948305] [2019-12-07 15:48:07,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091324035] [2019-12-07 15:48:07,594 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/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-12-07 15:48:07,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:48:07,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:48:07,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 15:48:07,632 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:48:07,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:48:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:07,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:48:07,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-12-07 15:48:07,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73794422] [2019-12-07 15:48:07,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 15:48:07,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 15:48:07,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:48:07,782 INFO L87 Difference]: Start difference. First operand 316 states and 357 transitions. Second operand 19 states. [2019-12-07 15:48:11,314 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-12-07 15:48:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:14,364 INFO L93 Difference]: Finished difference Result 764 states and 845 transitions. [2019-12-07 15:48:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-07 15:48:14,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2019-12-07 15:48:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:14,365 INFO L225 Difference]: With dead ends: 764 [2019-12-07 15:48:14,365 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:48:14,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2032, Invalid=5978, Unknown=0, NotChecked=0, Total=8010 [2019-12-07 15:48:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:48:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:48:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:48:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:48:14,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2019-12-07 15:48:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:14,368 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:48:14,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 15:48:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:48:14,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:48:14,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:48:14,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:48:15,131 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 381 DAG size of output: 326 [2019-12-07 15:48:15,574 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 296 [2019-12-07 15:48:15,688 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 225 [2019-12-07 15:48:16,146 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 336 [2019-12-07 15:48:16,536 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 314 [2019-12-07 15:48:16,930 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 295 [2019-12-07 15:48:17,541 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 331 [2019-12-07 15:48:17,965 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 315 [2019-12-07 15:48:18,265 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 303 [2019-12-07 15:48:18,396 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 235 [2019-12-07 15:48:18,501 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 225 [2019-12-07 15:48:19,002 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 338 [2019-12-07 15:48:19,110 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 228 [2019-12-07 15:48:19,253 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 227 [2019-12-07 15:48:22,169 WARN L192 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 314 DAG size of output: 69 [2019-12-07 15:48:23,264 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 284 DAG size of output: 29 [2019-12-07 15:48:25,064 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 223 DAG size of output: 91 [2019-12-07 15:48:26,934 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 322 DAG size of output: 72 [2019-12-07 15:48:29,930 WARN L192 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 297 DAG size of output: 87 [2019-12-07 15:48:31,077 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 283 DAG size of output: 19 [2019-12-07 15:48:32,941 WARN L192 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 225 DAG size of output: 93 [2019-12-07 15:48:35,705 WARN L192 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 322 DAG size of output: 73 [2019-12-07 15:48:37,781 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 301 DAG size of output: 65 [2019-12-07 15:48:40,763 WARN L192 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 283 DAG size of output: 121 [2019-12-07 15:48:41,380 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 27 [2019-12-07 15:48:42,856 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 223 DAG size of output: 91 [2019-12-07 15:48:44,896 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 330 DAG size of output: 81 [2019-12-07 15:48:46,737 WARN L192 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 225 DAG size of output: 93 [2019-12-07 15:48:47,310 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 25 [2019-12-07 15:48:47,312 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,312 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,312 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:48:47,312 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,313 INFO L242 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse16 (* 6 ULTIMATE.start_main_~l~0)) (.cse17 (* 8 ULTIMATE.start_main_~n~0)) (.cse0 (div ULTIMATE.start_main_~j~0 2)) (.cse18 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse8 (<= ULTIMATE.start_main_~l~0 1)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse13 (<= (+ .cse18 2) ULTIMATE.start_main_~n~0)) (.cse10 (<= 2 ULTIMATE.start_main_~i~0)) (.cse11 (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))))) (.cse3 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ .cse0 1))) (.cse7 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (<= 1 ULTIMATE.start_main_~l~0)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse9 (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 (<= ULTIMATE.start_main_~j~0 .cse18)) (.cse5 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse16) (+ .cse17 (* 3 ULTIMATE.start_main_~j~0)))) (.cse15 (<= .cse18 ULTIMATE.start_main_~r~0))) (or (and (<= 1 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse5 .cse11 .cse12 .cse6 .cse8) (and .cse2 .cse9 .cse13 .cse10 .cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse12 .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))) .cse15) (and (or (and .cse2 .cse9 .cse13 .cse10 .cse11 .cse15) (and .cse1 .cse3 .cse4 .cse7 .cse15)) .cse5 .cse12 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse16 3) .cse17)) (and .cse1 .cse9 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse4 (<= .cse18 ULTIMATE.start_main_~j~0) .cse5 .cse14 .cse15 (<= 2 ULTIMATE.start_main_~j~0))))) [2019-12-07 15:48:47,313 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,313 INFO L242 CegarLoopResult]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse16 (* 6 ULTIMATE.start_main_~l~0)) (.cse17 (* 8 ULTIMATE.start_main_~n~0)) (.cse19 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse6 (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))))) (.cse10 (<= (+ .cse19 2) ULTIMATE.start_main_~n~0)) (.cse3 (<= 2 ULTIMATE.start_main_~i~0)) (.cse0 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse13 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ (div ULTIMATE.start_main_~j~0 2) 1))) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse7 (<= 1 ULTIMATE.start_main_~r~0)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse8 (<= ULTIMATE.start_main_~l~0 1)) (.cse12 (<= 1 ULTIMATE.start_main_~i~0)) (.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)))) (.cse14 (<= ULTIMATE.start_main_~j~0 .cse19)) (.cse18 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse16) (+ .cse17 (* 3 ULTIMATE.start_main_~j~0)))) (.cse11 (<= .cse19 ULTIMATE.start_main_~r~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (or (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse6 .cse11) (and .cse12 .cse13 .cse2 .cse14 .cse15 .cse11)) .cse5 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse16 3) .cse17)) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse18 (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))) .cse11) (and .cse12 .cse0 .cse2 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9) (and .cse12 .cse1 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse14 (<= .cse19 ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse18 .cse11 .cse9)))) [2019-12-07 15:48:47,313 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,313 INFO L242 CegarLoopResult]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse16 (* 6 ULTIMATE.start_main_~l~0)) (.cse17 (* 8 ULTIMATE.start_main_~n~0)) (.cse0 (div ULTIMATE.start_main_~j~0 2)) (.cse18 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse6 (<= 1 ULTIMATE.start_main_~r~0)) (.cse8 (<= ULTIMATE.start_main_~l~0 1)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse13 (<= (+ .cse18 2) ULTIMATE.start_main_~n~0)) (.cse10 (<= 2 ULTIMATE.start_main_~i~0)) (.cse11 (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))))) (.cse3 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ .cse0 1))) (.cse7 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse12 (<= 1 ULTIMATE.start_main_~l~0)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse9 (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 (<= ULTIMATE.start_main_~j~0 .cse18)) (.cse5 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse16) (+ .cse17 (* 3 ULTIMATE.start_main_~j~0)))) (.cse15 (<= .cse18 ULTIMATE.start_main_~r~0))) (or (and (<= 1 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse5 .cse11 .cse12 .cse6 .cse8) (and .cse2 .cse9 .cse13 .cse10 .cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) .cse12 .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))) .cse15) (and (or (and .cse2 .cse9 .cse13 .cse10 .cse11 .cse15) (and .cse1 .cse3 .cse4 .cse7 .cse15)) .cse5 .cse12 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse16 3) .cse17)) (and .cse1 .cse9 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse4 (<= .cse18 ULTIMATE.start_main_~j~0) .cse5 .cse14 .cse15 (<= 2 ULTIMATE.start_main_~j~0))))) [2019-12-07 15:48:47,313 INFO L246 CegarLoopResult]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,313 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,314 INFO L242 CegarLoopResult]: At program point L4-11(lines 3 8) the Hoare annotation is: (let ((.cse16 (* 6 ULTIMATE.start_main_~l~0)) (.cse17 (* 8 ULTIMATE.start_main_~n~0)) (.cse19 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse6 (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))))) (.cse10 (<= (+ .cse19 2) ULTIMATE.start_main_~n~0)) (.cse3 (<= 2 ULTIMATE.start_main_~i~0)) (.cse0 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse13 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ (div ULTIMATE.start_main_~j~0 2) 1))) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse7 (<= 1 ULTIMATE.start_main_~r~0)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse8 (<= ULTIMATE.start_main_~l~0 1)) (.cse12 (<= 1 ULTIMATE.start_main_~i~0)) (.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)))) (.cse14 (<= ULTIMATE.start_main_~j~0 .cse19)) (.cse18 (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse16) (+ .cse17 (* 3 ULTIMATE.start_main_~j~0)))) (.cse11 (<= .cse19 ULTIMATE.start_main_~r~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (or (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse6 .cse11) (and .cse12 .cse13 .cse2 .cse14 .cse15 .cse11)) .cse5 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse16 3) .cse17)) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse18 (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))) .cse11) (and .cse12 .cse0 .cse2 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9) (and .cse12 .cse1 (<= (div (- ULTIMATE.start_main_~j~0) (- 2)) (div (+ ULTIMATE.start_main_~n~0 (- 2)) 2)) .cse14 (<= .cse19 ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse18 .cse11 .cse9)))) [2019-12-07 15:48:47,314 INFO L246 CegarLoopResult]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,314 INFO L242 CegarLoopResult]: At program point L4-14(lines 3 8) the Hoare annotation is: (let ((.cse8 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse5 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse6 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse0 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (<= .cse8 ULTIMATE.start_main_~j~0)) (.cse2 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= 1 ULTIMATE.start_main_~l~0)) (.cse9 (<= .cse8 ULTIMATE.start_main_~r~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (and (<= 1 (div ULTIMATE.start_main_~j~0 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ULTIMATE.start_main_~r~0) .cse6 (<= ULTIMATE.start_main_~l~0 1)) (and .cse0 .cse1 .cse7 .cse3 (<= (+ ULTIMATE.start_main_~r~0 .cse8) (* 2 ULTIMATE.start_main_~n~0)) .cse5 .cse4 .cse6 .cse9) (and (let ((.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))))) (or (and .cse10 (<= (+ .cse8 2) ULTIMATE.start_main_~n~0) (<= 2 ULTIMATE.start_main_~i~0) .cse2 .cse3 .cse4 .cse9 (<= 2 ULTIMATE.start_main_~j~0)) (and .cse0 .cse10 .cse7 .cse2 .cse3 .cse4 .cse9))) .cse1 (<= (+ (* 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-12-07 15:48:47,314 INFO L246 CegarLoopResult]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,314 INFO L246 CegarLoopResult]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2019-12-07 15:48:47,314 INFO L242 CegarLoopResult]: At program point L4-17(lines 3 8) the Hoare annotation is: (let ((.cse14 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse8 (* 6 ULTIMATE.start_main_~l~0)) (.cse9 (* 8 ULTIMATE.start_main_~n~0)) (.cse2 (<= .cse14 ULTIMATE.start_main_~j~0)) (.cse7 (<= .cse14 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~i~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse11 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse6 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse15 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ (* 5 ULTIMATE.start_main_~r~0) .cse8 3) .cse9)) (and (let ((.cse13 (* 3 ULTIMATE.start_main_~r~0))) (let ((.cse12 (<= 14 (+ .cse13 (* 4 ULTIMATE.start_main_~l~0)))) (.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))))) (or (and .cse0 .cse10 .cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse11 .cse3 .cse5 .cse6 .cse7 .cse12) (and (<= (+ .cse13 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse7 .cse12) (and .cse10 .cse1 (<= (+ .cse14 2) ULTIMATE.start_main_~n~0) (<= 2 ULTIMATE.start_main_~i~0) .cse11 .cse3 .cse5 .cse7 .cse15)))))) (<= (+ (* 8 ULTIMATE.start_main_~r~0) .cse8) (+ .cse9 (* 3 ULTIMATE.start_main_~j~0)))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~r~0 .cse14) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse11 .cse5 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~r~0) .cse6 (<= ULTIMATE.start_main_~l~0 1) .cse15)))) [2019-12-07 15:48:47,314 INFO L246 CegarLoopResult]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,314 INFO L242 CegarLoopResult]: At program point L4-20(lines 3 8) the Hoare annotation is: (let ((.cse12 (* 2 ULTIMATE.start_main_~l~0)) (.cse1 (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)))) (let ((.cse6 (<= .cse1 (+ ULTIMATE.start_main_~l~0 1))) (.cse10 (<= 2 ULTIMATE.start_main_~j~0)) (.cse0 (<= 1 ULTIMATE.start_main_~i~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= 1 ULTIMATE.start_main_~r~0)) (.cse8 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= .cse12 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0))) (or (and .cse0 (<= .cse1 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse4 .cse5 .cse3 .cse7 .cse8 (<= ULTIMATE.start_main_~l~0 1) .cse10) (and (let ((.cse11 (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 .cse11 (<= (+ .cse12 2) ULTIMATE.start_main_~n~0) (<= 2 ULTIMATE.start_main_~i~0) .cse2 .cse5 .cse4 .cse9 .cse10) (and .cse0 .cse11 .cse2 (<= .cse12 ULTIMATE.start_main_~j~0) .cse4 .cse5 .cse7 .cse8 .cse9))) .cse3 (<= (+ (* 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-12-07 15:48:47,314 INFO L246 CegarLoopResult]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,315 INFO L242 CegarLoopResult]: At program point L4-23(lines 3 8) the Hoare annotation is: (let ((.cse11 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse2 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ ULTIMATE.start_main_~l~0 1))) (.cse1 (<= .cse11 ULTIMATE.start_main_~j~0)) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= (+ ULTIMATE.start_main_~r~0 .cse11) (* 2 ULTIMATE.start_main_~n~0))) (.cse6 (<= 1 ULTIMATE.start_main_~l~0)) (.cse7 (<= 1 ULTIMATE.start_main_~r~0)) (.cse8 (<= .cse11 ULTIMATE.start_main_~r~0)) (.cse9 (<= 2 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse3 .cse7 (<= ULTIMATE.start_main_~l~0 1) .cse9) (and (let ((.cse12 (* 3 ULTIMATE.start_main_~r~0))) (let ((.cse10 (<= 14 (+ .cse12 (* 4 ULTIMATE.start_main_~l~0))))) (or (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) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse0 (<= (+ .cse11 2) ULTIMATE.start_main_~n~0) (<= (+ .cse12 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .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-12-07 15:48:47,315 INFO L246 CegarLoopResult]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,315 INFO L242 CegarLoopResult]: At program point L4-26(lines 3 8) the Hoare annotation is: (let ((.cse9 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse0 (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2))) (.cse6 (<= .cse9 ULTIMATE.start_main_~r~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~r~0)) (.cse7 (<= ULTIMATE.start_main_~l~0 1)) (.cse8 (<= 2 ULTIMATE.start_main_~j~0))) (or (and (<= .cse0 (+ (div ULTIMATE.start_main_~j~0 2) 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= .cse0 (+ ULTIMATE.start_main_~l~0 1)) .cse2 .cse4 .cse3 .cse5 .cse7 .cse8) (and (<= (+ (* 3 ULTIMATE.start_main_~r~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (<= (+ .cse9 2) ULTIMATE.start_main_~n~0) .cse1 .cse3 .cse4 .cse2 .cse5 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ (* 8 ULTIMATE.start_main_~n~0) (* 3 ULTIMATE.start_main_~j~0))) .cse6 .cse8) (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))) .cse1 .cse2 .cse4 .cse3 .cse5 .cse7 .cse8)))) [2019-12-07 15:48:47,315 INFO L246 CegarLoopResult]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,315 INFO L242 CegarLoopResult]: At program point L4-29(lines 3 8) the Hoare annotation is: (let ((.cse7 (* 2 ULTIMATE.start_main_~l~0)) (.cse0 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse1 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ .cse0 1))) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_main_~l~0)) (.cse6 (<= .cse7 ULTIMATE.start_main_~r~0))) (or (and (<= 1 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~l~0 1)) (and .cse1 .cse2 .cse4 .cse3 .cse5 .cse6) (and (let ((.cse8 (<= 2 ULTIMATE.start_main_~j~0))) (or (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))) .cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= .cse7 ULTIMATE.start_main_~j~0) .cse4 .cse3 .cse5 .cse6 .cse8) (and .cse2 (<= (+ (* 3 ULTIMATE.start_main_~r~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) (* 2 ULTIMATE.start_main_~j~0))) (<= (+ .cse7 2) ULTIMATE.start_main_~n~0) .cse4 .cse3 .cse5 .cse6 .cse8))) (<= (+ (* 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-12-07 15:48:47,315 INFO L246 CegarLoopResult]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,315 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,315 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,315 INFO L242 CegarLoopResult]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (= 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_~l~0) (<= 2 ULTIMATE.start_main_~j~0)) [2019-12-07 15:48:47,315 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L242 CegarLoopResult]: 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-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L242 CegarLoopResult]: 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-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,316 INFO L242 CegarLoopResult]: At program point L4-41(lines 3 8) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~l~0 1))) (let ((.cse0 (<= 1 (div ULTIMATE.start_main_~j~0 2))) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= 1 ULTIMATE.start_main_~r~0)) (.cse5 (<= ULTIMATE.start_main_~l~0 1)) (.cse6 (<= .cse7 ULTIMATE.start_main_~n~0))) (or (and .cse0 .cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) .cse7) .cse2 .cse3 .cse4 .cse5 .cse6)))) [2019-12-07 15:48:47,316 INFO L246 CegarLoopResult]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L249 CegarLoopResult]: At program point L55(lines 10 56) the Hoare annotation is: true [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L242 CegarLoopResult]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse24 (+ ULTIMATE.start_main_~l~0 1)) (.cse21 (* 8 ULTIMATE.start_main_~n~0)) (.cse26 (* 3 ULTIMATE.start_main_~j~0)) (.cse13 (* 2 ULTIMATE.start_main_~l~0)) (.cse28 (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2))) (.cse29 (div ULTIMATE.start_main_~j~0 2))) (let ((.cse11 (<= 1 ULTIMATE.start_main_~i~0)) (.cse17 (<= .cse28 (+ .cse29 1))) (.cse12 (<= ULTIMATE.start_main_~j~0 .cse13)) (.cse18 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse16 (<= 2 ULTIMATE.start_main_~j~0)) (.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)))) (.cse4 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse14 (<= (+ (* 8 ULTIMATE.start_main_~r~0) (* 6 ULTIMATE.start_main_~l~0)) (+ .cse21 .cse26))) (.cse0 (<= 1 .cse29)) (.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse22 (<= .cse28 .cse24)) (.cse23 (exists ((v_ULTIMATE.start_main_~j~0_20 Int)) (let ((.cse27 (div v_ULTIMATE.start_main_~j~0_20 2))) (and (<= (* 2 v_ULTIMATE.start_main_~j~0_20) ULTIMATE.start_main_~j~0) (<= 1 .cse27) (<= (div (+ (* ULTIMATE.start_main_~r~0 (- 1)) (- 1)) (- 2)) (+ .cse27 1)))))) (.cse8 (<= 1 ULTIMATE.start_main_~r~0)) (.cse9 (<= ULTIMATE.start_main_~l~0 1)) (.cse10 (<= .cse24 ULTIMATE.start_main_~n~0)) (.cse20 (<= (+ (* 3 ULTIMATE.start_main_~r~0) (* 4 ULTIMATE.start_main_~i~0) 10) (+ (* 4 ULTIMATE.start_main_~n~0) .cse26))) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse19 (<= (+ .cse13 2) ULTIMATE.start_main_~n~0)) (.cse3 (<= 2 ULTIMATE.start_main_~i~0)) (.cse7 (<= 1 ULTIMATE.start_main_~l~0)) (.cse15 (<= .cse13 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse5 (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)) (+ .cse5 1)) (<= 1 .cse5)))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse12 (<= .cse13 ULTIMATE.start_main_~j~0) .cse14 .cse15 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse6 .cse8 .cse18 .cse9 .cse16) (and .cse11 .cse17 .cse12 .cse14 .cse18 .cse15 .cse16) (and (or (and .cse1 .cse19 .cse3 .cse4 .cse6 .cse7 .cse15) (and .cse20 .cse2 .cse19 .cse3 .cse6 .cse7 .cse15)) .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))) (<= (+ (* 5 ULTIMATE.start_main_~r~0) 23) (+ (* 8 ULTIMATE.start_main_~l~0) .cse21))) (and .cse2 .cse3 .cse22 .cse23 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse6 .cse7 .cse22 .cse23 .cse8 .cse9 .cse10) (and .cse20 .cse2 .cse19 (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) .cse24) .cse3 (exists ((v_ULTIMATE.start_main_~j~0_23 Int)) (let ((.cse25 (div v_ULTIMATE.start_main_~j~0_23 2))) (and (<= (div (- ULTIMATE.start_main_~r~0) (- 2)) (+ .cse25 1)) (<= 1 .cse25) (<= (+ v_ULTIMATE.start_main_~j~0_23 1) (div ULTIMATE.start_main_~j~0 2))))) .cse7 .cse15)))) [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point L25(lines 25 32) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point L25-1(lines 25 32) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,317 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 15:48:47,318 INFO L246 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-12-07 15:48:47,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:48:47 BoogieIcfgContainer [2019-12-07 15:48:47,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:48:47,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:48:47,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:48:47,378 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:48:47,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:47:49" (3/4) ... [2019-12-07 15:48:47,382 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:48:47,393 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 15:48:47,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 15:48:47,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:48:47,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 <= j / 2 && (\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) && 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)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) || (((((((1 <= i && (\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) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((((((1 <= i && !(0 == cond)) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && r <= n) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j)) || ((((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && 8 * r + 6 * l <= 8 * n + 3 * j) && i + 1 <= n) && 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 + 2 <= n) && 2 <= i) && 1 == cond) && r <= n) && 1 <= l) && 2 * l <= r) || ((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 * l + 2 <= n) && 2 <= i) && r <= 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)) && 5 * r + 23 <= 8 * l + 8 * n)) || ((((((!(0 == cond) && 2 <= i) && (r * -1 + -1) / -2 <= l + 1) && (\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 + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && r <= n) && 1 <= l) && 2 * l <= r)) || ((((((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && (r * -1 + -1) / -2 <= l + 1) && (\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 + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && 1 <= r) && l <= 1) && l + 1 <= n)) || (((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 * l + 2 <= n) && -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)) && 1 <= l) && 2 * l <= r) [2019-12-07 15:48:47,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 <= j / 2 && 1 <= i) && j + 1 <= n) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && 1 == cond) && 1 <= r) && i + 1 <= n) && l <= 1) || (((((((j + 1 <= 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)) && 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 <= r) && l <= 1)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || ((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) [2019-12-07 15:48:47,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= j / 2 && 1 <= i) && 1 == cond) && r <= n) && j <= n) && 1 <= l) && (r * -1 + -1) / -2 <= l + 1) && 1 <= r) && i + 1 <= n) && l <= 1) || ((((((((1 <= i && 1 == cond) && 2 * l <= j) && j <= n) && r + 2 * l <= 2 * n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && i + 1 <= n) && 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 * l + 2 <= n) && 2 <= i) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || ((((((1 <= i && (\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 <= l) && 2 * l <= r)) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) [2019-12-07 15:48:47,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((j + 1 <= 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)) && 2 <= i) && r <= n) && 1 <= l) && (\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 <= r) && l <= 1) && 2 <= j) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || (((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && !(0 == cond)) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || ((((((((((1 <= i && j + 1 <= n) && !(0 == cond)) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && r <= n) && 1 <= l) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) [2019-12-07 15:48:47,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= i && !(0 == cond)) && 2 * l <= j) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && i + 1 <= n) && 2 * l <= r) && 5 * r + 6 * l + 3 <= 8 * n) || ((((((((((((1 <= i && (\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)) && 1 == cond) && 2 * l <= j) && r <= n) && j <= n) && 1 <= l) && i + 1 <= n) && 2 * l <= r) && 14 <= 3 * r + 4 * l) || (3 * r + 10 <= 4 * n + 2 * j && ((((((((((1 <= i && (\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 * l <= j) && r <= n) && j <= n) && 1 <= l) && i + 1 <= n) && 2 * l <= r) && 14 <= 3 * r + 4 * l) || (((((((((\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 * l + 2 <= n) && 2 <= i) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j)))) && 8 * r + 6 * l <= 8 * n + 3 * j)) || ((((((((1 <= i && !(0 == cond)) && r <= 2 * l) && 2 * l <= j) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && i + 1 <= n) && 2 * l <= r)) || (((((((((1 <= i && !(0 == cond)) && r <= n) && 1 <= l) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j) [2019-12-07 15:48:47,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 <= j / 2 && 1 <= i) && j + 1 <= n) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && 1 == cond) && 1 <= r) && i + 1 <= n) && l <= 1) || (((((((j + 1 <= 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)) && 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 <= r) && l <= 1)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || ((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) [2019-12-07 15:48:47,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((j + 1 <= 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)) && 2 <= i) && r <= n) && 1 <= l) && (\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 <= r) && l <= 1) && 2 <= j) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || (((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && !(0 == cond)) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || ((((((((((1 <= i && j + 1 <= n) && !(0 == cond)) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && r <= n) && 1 <= l) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) [2019-12-07 15:48:47,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && 1 == cond) && 1 <= l) && r <= n) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= r) && i + 1 <= n) && 2 * l <= r) || (((((((((1 <= i && 1 == cond) && (r * -1 + -1) / -2 <= l + 1) && r <= n) && j <= n) && 1 <= l) && 1 <= r) && i + 1 <= n) && l <= 1) && 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 + 2 <= n) && 2 <= i) && 1 == cond) && j <= n) && r <= n) && 2 * l <= r) && 2 <= j) || ((((((((1 <= i && (\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) && r <= n) && j <= n) && 1 <= r) && i + 1 <= n) && 2 * l <= r)) && 1 <= l) && 8 * r + 6 * l <= 8 * n + 3 * j) [2019-12-07 15:48:47,416 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(0 == cond) && 2 * l <= j) && (r * -1 + -1) / -2 <= l + 1) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= l) && 1 <= r) && 2 * l <= r) || (((((((!(0 == cond) && (r * -1 + -1) / -2 <= l + 1) && j <= n) && 1 <= l) && r <= n) && 1 <= r) && l <= 1) && 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)) && 1 == cond) && 2 * l <= j) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= l) && 1 <= r) && 2 * l <= r) && 14 <= 3 * r + 4 * l) && 2 <= j) || ((((((((((!(0 == cond) && 2 * l + 2 <= n) && 3 * r + 10 <= 4 * n + 2 * j) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= l) && 1 <= r) && 2 * l <= r) && 14 <= 3 * r + 4 * l) && 2 <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) [2019-12-07 15:48:47,417 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((r * -1 + -1) / -2 <= j / 2 + 1 && 1 == cond) && 1 <= l) && r <= n) && j <= n) && 1 <= r) && 2 * l <= r) || (((((((1 == cond && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && j <= n) && r <= n) && 1 <= r) && l <= 1) && 2 <= j)) || (((((((((3 * r + 10 <= 4 * n + 2 * j && 2 * l + 2 <= n) && 1 == cond) && r <= n) && j <= n) && 1 <= l) && 1 <= r) && 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) && 1 == cond) && 1 <= l) && j <= n) && r <= n) && 1 <= r) && l <= 1) && 2 <= j) [2019-12-07 15:48:47,417 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= j / 2 && (r * -1 + -1) / -2 <= j / 2 + 1) && !(0 == cond)) && j <= n) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) || ((((((r * -1 + -1) / -2 <= j / 2 + 1 && !(0 == cond)) && r <= n) && j <= 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) && !(0 == cond)) && 1 == cond) && 2 * l <= j) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || (((((((!(0 == cond) && 3 * r + 10 <= 4 * n + 2 * j) && 2 * l + 2 <= n) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) [2019-12-07 15:48:47,436 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f36e0e4-efc4-494a-865f-c88bce2c6646/bin/uautomizer/witness.graphml [2019-12-07 15:48:47,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:48:47,437 INFO L168 Benchmark]: Toolchain (without parser) took 58116.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 943.5 MB in the beginning and 1.3 GB in the end (delta: -379.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:47,437 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:47,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:47,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:47,438 INFO L168 Benchmark]: Boogie Preprocessor took 16.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:47,438 INFO L168 Benchmark]: RCFGBuilder took 221.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:47,438 INFO L168 Benchmark]: TraceAbstraction took 57615.07 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -273.0 MB). Peak memory consumption was 580.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:47,438 INFO L168 Benchmark]: Witness Printer took 58.32 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:47,440 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57615.07 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -273.0 MB). Peak memory consumption was 580.8 MB. Max. memory is 11.5 GB. * Witness Printer took 58.32 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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] * 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-12-07 15:48:47,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,446 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 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && 1 == cond) && 1 <= l) && r <= n) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= r) && i + 1 <= n) && 2 * l <= r) || (((((((((1 <= i && 1 == cond) && (r * -1 + -1) / -2 <= l + 1) && r <= n) && j <= n) && 1 <= l) && 1 <= r) && i + 1 <= n) && l <= 1) && 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 + 2 <= n) && 2 <= i) && 1 == cond) && j <= n) && r <= n) && 2 * l <= r) && 2 <= j) || ((((((((1 <= i && (\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) && r <= n) && j <= n) && 1 <= r) && i + 1 <= n) && 2 * l <= r)) && 1 <= l) && 8 * r + 6 * l <= 8 * n + 3 * j) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((1 <= j / 2 && !(0 == cond)) && 1 == cond) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) || (((((((1 <= j / 2 && !(0 == cond)) && (r * -1 + -1) / -2 <= l + 1) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,451 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 <= j / 2 && 1 <= i) && j + 1 <= n) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && 1 == cond) && 1 <= r) && i + 1 <= n) && l <= 1) || (((((((j + 1 <= 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)) && 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 <= r) && l <= 1)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || ((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,452 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 <= j / 2 && (r * -1 + -1) / -2 <= j / 2 + 1) && !(0 == cond)) && j <= n) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) || ((((((r * -1 + -1) / -2 <= j / 2 + 1 && !(0 == cond)) && r <= n) && j <= 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) && !(0 == cond)) && 1 == cond) && 2 * l <= j) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || (((((((!(0 == cond) && 3 * r + 10 <= 4 * n + 2 * j) && 2 * l + 2 <= n) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,455 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 <= i && !(0 == cond)) && 2 * l <= j) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && i + 1 <= n) && 2 * l <= r) && 5 * r + 6 * l + 3 <= 8 * n) || ((((((((((((1 <= i && (\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)) && 1 == cond) && 2 * l <= j) && r <= n) && j <= n) && 1 <= l) && i + 1 <= n) && 2 * l <= r) && 14 <= 3 * r + 4 * l) || (3 * r + 10 <= 4 * n + 2 * j && ((((((((((1 <= i && (\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 * l <= j) && r <= n) && j <= n) && 1 <= l) && i + 1 <= n) && 2 * l <= r) && 14 <= 3 * r + 4 * l) || (((((((((\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 * l + 2 <= n) && 2 <= i) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j)))) && 8 * r + 6 * l <= 8 * n + 3 * j)) || ((((((((1 <= i && !(0 == cond)) && r <= 2 * l) && 2 * l <= j) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && i + 1 <= n) && 2 * l <= r)) || (((((((((1 <= i && !(0 == cond)) && r <= n) && 1 <= l) && j <= n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j) - 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-12-07 15:48:47,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: ((((((((((((j + 1 <= 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)) && 2 <= i) && r <= n) && 1 <= l) && (\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 <= r) && l <= 1) && 2 <= j) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || (((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && !(0 == cond)) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || ((((((((((1 <= i && j + 1 <= n) && !(0 == cond)) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && r <= n) && 1 <= l) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,461 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 + -1) / -2 <= j / 2 + 1 && 1 == cond) && 1 <= l) && r <= n) && j <= n) && 1 <= r) && 2 * l <= r) || (((((((1 == cond && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && j <= n) && r <= n) && 1 <= r) && l <= 1) && 2 <= j)) || (((((((((3 * r + 10 <= 4 * n + 2 * j && 2 * l + 2 <= n) && 1 == cond) && r <= n) && j <= n) && 1 <= l) && 1 <= r) && 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) && 1 == cond) && 1 <= l) && j <= n) && r <= n) && 1 <= r) && l <= 1) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,462 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 <= j / 2 && 1 <= i) && 1 == cond) && r <= n) && j <= n) && 1 <= l) && (r * -1 + -1) / -2 <= l + 1) && 1 <= r) && i + 1 <= n) && l <= 1) || ((((((((1 <= i && 1 == cond) && 2 * l <= j) && j <= n) && r + 2 * l <= 2 * n) && (r * -1 + -1) / -2 <= l + 1) && 1 <= l) && i + 1 <= n) && 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 * l + 2 <= n) && 2 <= i) && r <= n) && j <= n) && 1 <= l) && 2 * l <= r) && 2 <= j) || ((((((1 <= i && (\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 <= l) && 2 * l <= r)) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 15:48:47,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_20,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] Derived loop invariant: ((((((((((((((((1 <= j / 2 && (\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) && 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)) && r <= n) && 1 <= l) && 1 <= r) && l <= 1) && l + 1 <= n) || (((((((1 <= i && (\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) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j)) || ((((((((1 <= i && !(0 == cond)) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && r <= n) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j)) || ((((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && 8 * r + 6 * l <= 8 * n + 3 * j) && i + 1 <= n) && 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 + 2 <= n) && 2 <= i) && 1 == cond) && r <= n) && 1 <= l) && 2 * l <= r) || ((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 * l + 2 <= n) && 2 <= i) && r <= 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)) && 5 * r + 23 <= 8 * l + 8 * n)) || ((((((!(0 == cond) && 2 <= i) && (r * -1 + -1) / -2 <= l + 1) && (\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 + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && r <= n) && 1 <= l) && 2 * l <= r)) || ((((((((1 <= j / 2 && !(0 == cond)) && r <= n) && 1 <= l) && (r * -1 + -1) / -2 <= l + 1) && (\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 + -1) / -2 <= v_ULTIMATE.start_main_~j~0_20 / 2 + 1)) && 1 <= r) && l <= 1) && l + 1 <= n)) || (((((((3 * r + 4 * i + 10 <= 4 * n + 3 * j && !(0 == cond)) && 2 * l + 2 <= n) && -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)) && 1 <= l) && 2 * l <= r) - 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-12-07 15:48:47,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,472 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 <= j / 2 && 1 <= i) && j + 1 <= n) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && 1 == cond) && 1 <= r) && i + 1 <= n) && l <= 1) || (((((((j + 1 <= 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)) && 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 <= r) && l <= 1)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && 1 == cond) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || ((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 == cond) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,473 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) && 2 * l <= j) && (r * -1 + -1) / -2 <= l + 1) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= l) && 1 <= r) && 2 * l <= r) || (((((((!(0 == cond) && (r * -1 + -1) / -2 <= l + 1) && j <= n) && 1 <= l) && r <= n) && 1 <= r) && l <= 1) && 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)) && 1 == cond) && 2 * l <= j) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= l) && 1 <= r) && 2 * l <= r) && 14 <= 3 * r + 4 * l) && 2 <= j) || ((((((((((!(0 == cond) && 2 * l + 2 <= n) && 3 * r + 10 <= 4 * n + 2 * j) && r <= n) && j <= n) && r + 2 * l <= 2 * n) && 1 <= l) && 1 <= r) && 2 * l <= r) && 14 <= 3 * r + 4 * l) && 2 <= j)) && 8 * r + 6 * l <= 8 * n + 3 * j) - InvariantResult [Line: 3]: Loop Invariant [2019-12-07 15:48:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_23,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_25,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] [2019-12-07 15:48:47,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~j~0_22,QUANTIFIED] Derived loop invariant: ((((((((((((j + 1 <= 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)) && 2 <= i) && r <= n) && 1 <= l) && (\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 <= r) && l <= 1) && 2 <= j) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 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)) && 2 * l <= r) || (((((1 <= i && (r * -1 + -1) / -2 <= j / 2 + 1) && !(0 == cond)) && j <= 2 * l) && i + 1 <= n) && 2 * l <= r)) && 1 <= l) && 5 * r + 6 * l + 3 <= 8 * n)) || (((((((((j + 1 <= 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)) && 2 * l + 2 <= n) && 2 <= i) && r <= n) && 1 <= l) && 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)) && 2 * l <= r)) || ((((((((((1 <= i && j + 1 <= n) && !(0 == cond)) && (r * -1 + -1) / -2 <= j / 2 + 1) && j <= 2 * l) && r <= n) && 1 <= l) && 1 <= r) && i + 1 <= n) && l <= 1) && 2 <= j)) || ((((((((1 <= i && (\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 <= (n + -2) / 2) && j <= 2 * l) && 2 * l <= j) && 1 == cond) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= j) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((1 == cond && r <= n) && 8 * r + 6 * l <= 8 * n + 3 * j) && 2 * l <= r) && 2 <= l) && 2 <= j - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 14 error locations. Result: SAFE, OverallTime: 24.7s, OverallIterations: 20, TraceHistogramMax: 4, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 32.7s, HoareTripleCheckerStatistics: 1127 SDtfs, 4851 SDslu, 3350 SDs, 0 SdLazy, 6723 SolverSat, 3064 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 355 SyntacticMatches, 4 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13831 ImplicationChecksByTransitivity, 12.3s 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 1930 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 675 NumberOfFragments, 3439 HoareAnnotationTreeSize, 16 FomulaSimplifications, 874745053 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 16 FomulaSimplificationsInter, 201601517 FormulaSimplificationTreeSizeReductionInter, 28.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s 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...