./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 45da0ec55e80675b886f8e641f164866abb91ea1313f371255aeb32277275561 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:33:10,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:33:10,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:33:10,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:33:10,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:33:10,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:33:10,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:33:10,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:33:10,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:33:10,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:33:10,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:33:10,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:33:10,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:33:10,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:33:10,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:33:10,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:33:10,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:33:10,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:33:10,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:33:10,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:33:10,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:33:10,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:33:10,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:33:10,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:33:10,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:33:10,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:33:10,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:33:10,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:33:10,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:33:10,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:33:10,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:33:10,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:33:10,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:33:10,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:33:10,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:33:10,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:33:10,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:33:10,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:33:10,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:33:10,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:33:10,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:33:10,351 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 00:33:10,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:33:10,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:33:10,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:33:10,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:33:10,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:33:10,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:33:10,380 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:33:10,380 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:33:10,380 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:33:10,380 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:33:10,381 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:33:10,382 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:33:10,382 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:33:10,382 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:33:10,382 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:33:10,383 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:33:10,383 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:33:10,383 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:33:10,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:33:10,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:33:10,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:33:10,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:33:10,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:33:10,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:33:10,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:33:10,385 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:33:10,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:33:10,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:33:10,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:33:10,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:33:10,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:33:10,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:33:10,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:33:10,388 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:33:10,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:33:10,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:33:10,388 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:33:10,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:33:10,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:33:10,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:33:10,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45da0ec55e80675b886f8e641f164866abb91ea1313f371255aeb32277275561 [2022-11-22 00:33:10,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:33:10,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:33:10,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:33:10,787 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:33:10,787 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:33:10,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2022-11-22 00:33:14,023 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:33:14,482 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:33:14,486 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2022-11-22 00:33:14,523 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/data/efa8fbfca/67709c10e43c4f72b159016993c5d392/FLAG5952d2597 [2022-11-22 00:33:14,541 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/data/efa8fbfca/67709c10e43c4f72b159016993c5d392 [2022-11-22 00:33:14,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:33:14,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:33:14,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:33:14,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:33:14,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:33:14,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:33:14" (1/1) ... [2022-11-22 00:33:14,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b85a821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:14, skipping insertion in model container [2022-11-22 00:33:14,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:33:14" (1/1) ... [2022-11-22 00:33:14,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:33:14,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:33:15,203 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 00:33:15,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:33:15,841 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:33:15,882 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 00:33:15,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:33:16,123 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:33:16,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16 WrapperNode [2022-11-22 00:33:16,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:33:16,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:33:16,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:33:16,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:33:16,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,283 INFO L138 Inliner]: procedures = 501, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2022-11-22 00:33:16,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:33:16,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:33:16,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:33:16,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:33:16,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,353 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:33:16,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:33:16,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:33:16,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:33:16,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (1/1) ... [2022-11-22 00:33:16,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:33:16,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:16,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:33:16,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:33:16,494 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-22 00:33:16,494 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-22 00:33:16,494 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-22 00:33:16,494 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-22 00:33:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:33:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:33:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:33:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:33:16,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:33:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:33:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-22 00:33:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:33:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:33:16,671 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:33:16,673 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:33:17,060 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:33:17,151 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:33:17,151 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-22 00:33:17,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:17 BoogieIcfgContainer [2022-11-22 00:33:17,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:33:17,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:33:17,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:33:17,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:33:17,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:33:14" (1/3) ... [2022-11-22 00:33:17,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b681a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:33:17, skipping insertion in model container [2022-11-22 00:33:17,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:16" (2/3) ... [2022-11-22 00:33:17,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b681a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:33:17, skipping insertion in model container [2022-11-22 00:33:17,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:17" (3/3) ... [2022-11-22 00:33:17,176 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_predec_17_good.i [2022-11-22 00:33:17,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:33:17,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-22 00:33:17,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:33:17,291 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15af57b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:33:17,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-22 00:33:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-22 00:33:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:33:17,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:17,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:17,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1827108304, now seen corresponding path program 1 times [2022-11-22 00:33:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:17,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939122324] [2022-11-22 00:33:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:33:17,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:17,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939122324] [2022-11-22 00:33:17,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939122324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:17,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:17,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720728646] [2022-11-22 00:33:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:17,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:17,795 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:17,886 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-22 00:33:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:17,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-11-22 00:33:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:17,897 INFO L225 Difference]: With dead ends: 85 [2022-11-22 00:33:17,897 INFO L226 Difference]: Without dead ends: 44 [2022-11-22 00:33:17,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:17,904 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:17,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-22 00:33:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-22 00:33:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-11-22 00:33:17,946 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-11-22 00:33:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:17,948 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-11-22 00:33:17,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-11-22 00:33:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:33:17,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:17,950 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:17,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:33:17,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1263002824, now seen corresponding path program 1 times [2022-11-22 00:33:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:17,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189671546] [2022-11-22 00:33:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:33:18,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189671546] [2022-11-22 00:33:18,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189671546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039059645] [2022-11-22 00:33:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:18,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:18,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:18,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:18,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:33:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:18,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:33:18,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:33:18,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:33:18,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039059645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:18,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:33:18,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:33:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938766501] [2022-11-22 00:33:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:18,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:18,426 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:18,520 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-22 00:33:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:33:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-22 00:33:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:18,523 INFO L225 Difference]: With dead ends: 78 [2022-11-22 00:33:18,523 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 00:33:18,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:33:18,527 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:18,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 00:33:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-22 00:33:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-22 00:33:18,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2022-11-22 00:33:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:18,542 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-22 00:33:18,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-22 00:33:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:33:18,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:18,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:18,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:33:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:18,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1729598038, now seen corresponding path program 1 times [2022-11-22 00:33:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:18,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700695959] [2022-11-22 00:33:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:33:19,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700695959] [2022-11-22 00:33:19,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700695959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:19,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:19,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:33:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266639060] [2022-11-22 00:33:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:19,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:19,042 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:19,121 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-22 00:33:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:33:19,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 00:33:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:19,125 INFO L225 Difference]: With dead ends: 40 [2022-11-22 00:33:19,126 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 00:33:19,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:33:19,129 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:19,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 00:33:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 00:33:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-22 00:33:19,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2022-11-22 00:33:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:19,151 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-22 00:33:19,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-22 00:33:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:33:19,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:19,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:19,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:33:19,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1729499335, now seen corresponding path program 1 times [2022-11-22 00:33:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:19,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052611461] [2022-11-22 00:33:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:33:19,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:19,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052611461] [2022-11-22 00:33:19,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052611461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:19,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:19,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412576150] [2022-11-22 00:33:19,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:19,256 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:19,313 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-22 00:33:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:19,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 00:33:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:19,317 INFO L225 Difference]: With dead ends: 69 [2022-11-22 00:33:19,318 INFO L226 Difference]: Without dead ends: 51 [2022-11-22 00:33:19,318 INFO L412 NwaCegarLoop]: 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 [2022-11-22 00:33:19,326 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:19,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-22 00:33:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-11-22 00:33:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-22 00:33:19,345 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 12 [2022-11-22 00:33:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:19,346 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-22 00:33:19,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-22 00:33:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:33:19,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:19,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:19,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:33:19,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:19,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2077931549, now seen corresponding path program 1 times [2022-11-22 00:33:19,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:19,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595210740] [2022-11-22 00:33:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:33:19,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:19,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595210740] [2022-11-22 00:33:19,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595210740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:19,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:19,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456971750] [2022-11-22 00:33:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:19,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:19,490 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:19,541 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-22 00:33:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-22 00:33:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:19,543 INFO L225 Difference]: With dead ends: 40 [2022-11-22 00:33:19,543 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 00:33:19,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:19,545 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:19,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 00:33:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 00:33:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-22 00:33:19,552 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2022-11-22 00:33:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:19,552 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-22 00:33:19,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 00:33:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-22 00:33:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:33:19,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:19,554 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:19,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:33:19,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash -26369639, now seen corresponding path program 1 times [2022-11-22 00:33:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:19,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311589428] [2022-11-22 00:33:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:33:19,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:19,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311589428] [2022-11-22 00:33:19,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311589428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:19,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:19,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797348776] [2022-11-22 00:33:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:19,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:19,634 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:33:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:19,698 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-22 00:33:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-22 00:33:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:19,703 INFO L225 Difference]: With dead ends: 49 [2022-11-22 00:33:19,704 INFO L226 Difference]: Without dead ends: 47 [2022-11-22 00:33:19,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:19,706 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:19,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-22 00:33:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-22 00:33:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 00:33:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-22 00:33:19,730 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2022-11-22 00:33:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:19,731 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-22 00:33:19,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 00:33:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-22 00:33:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:33:19,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:19,733 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:19,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:33:19,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -448050471, now seen corresponding path program 1 times [2022-11-22 00:33:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:19,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899034607] [2022-11-22 00:33:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:19,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:19,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899034607] [2022-11-22 00:33:19,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899034607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:19,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:19,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094046625] [2022-11-22 00:33:19,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:19,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:19,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:19,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:19,834 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:19,884 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-22 00:33:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-22 00:33:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:19,887 INFO L225 Difference]: With dead ends: 65 [2022-11-22 00:33:19,887 INFO L226 Difference]: Without dead ends: 50 [2022-11-22 00:33:19,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:19,889 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:19,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-22 00:33:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-22 00:33:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 43 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 00:33:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-22 00:33:19,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2022-11-22 00:33:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:19,912 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-22 00:33:19,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-22 00:33:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:33:19,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:19,913 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:19,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:33:19,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1031286073, now seen corresponding path program 1 times [2022-11-22 00:33:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149671034] [2022-11-22 00:33:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 00:33:20,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149671034] [2022-11-22 00:33:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149671034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683458919] [2022-11-22 00:33:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:20,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:20,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:33:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:20,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:33:20,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:33:20,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:33:20,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683458919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:20,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:33:20,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:33:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941035411] [2022-11-22 00:33:20,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:20,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:20,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:20,192 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:33:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:20,253 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-11-22 00:33:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:33:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-11-22 00:33:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:20,254 INFO L225 Difference]: With dead ends: 74 [2022-11-22 00:33:20,254 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 00:33:20,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:33:20,255 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:20,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 00:33:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-22 00:33:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-22 00:33:20,261 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2022-11-22 00:33:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:20,261 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-22 00:33:20,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:33:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-22 00:33:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:33:20,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:20,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:20,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:33:20,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:20,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 886882175, now seen corresponding path program 1 times [2022-11-22 00:33:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:20,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199778464] [2022-11-22 00:33:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:20,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:20,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199778464] [2022-11-22 00:33:20,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199778464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:20,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002662387] [2022-11-22 00:33:20,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:20,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:20,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:20,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:20,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:33:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:20,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:33:20,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:20,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:33:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002662387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:20,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:33:20,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:33:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602086824] [2022-11-22 00:33:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:20,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:33:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:33:20,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:20,729 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:20,770 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-22 00:33:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:33:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-22 00:33:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:20,772 INFO L225 Difference]: With dead ends: 54 [2022-11-22 00:33:20,772 INFO L226 Difference]: Without dead ends: 36 [2022-11-22 00:33:20,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:33:20,774 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:20,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-22 00:33:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-22 00:33:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-22 00:33:20,780 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2022-11-22 00:33:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:20,780 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-22 00:33:20,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-22 00:33:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:33:20,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:20,782 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:20,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:33:20,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 00:33:20,989 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1723549009, now seen corresponding path program 1 times [2022-11-22 00:33:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94471101] [2022-11-22 00:33:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:21,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:21,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94471101] [2022-11-22 00:33:21,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94471101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:21,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:21,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753733030] [2022-11-22 00:33:21,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:21,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:21,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:21,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:21,039 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:21,061 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-22 00:33:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:21,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-22 00:33:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:21,063 INFO L225 Difference]: With dead ends: 36 [2022-11-22 00:33:21,063 INFO L226 Difference]: Without dead ends: 35 [2022-11-22 00:33:21,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:21,068 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:21,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-22 00:33:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-22 00:33:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-22 00:33:21,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2022-11-22 00:33:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:21,081 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-22 00:33:21,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-22 00:33:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 00:33:21,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:21,088 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:21,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:33:21,088 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1890411850, now seen corresponding path program 1 times [2022-11-22 00:33:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:21,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63664478] [2022-11-22 00:33:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:21,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:21,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63664478] [2022-11-22 00:33:21,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63664478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:21,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:21,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692598038] [2022-11-22 00:33:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:21,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:21,157 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:21,189 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-11-22 00:33:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-22 00:33:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:21,191 INFO L225 Difference]: With dead ends: 39 [2022-11-22 00:33:21,191 INFO L226 Difference]: Without dead ends: 38 [2022-11-22 00:33:21,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:21,192 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:21,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-22 00:33:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-22 00:33:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-11-22 00:33:21,198 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 25 [2022-11-22 00:33:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:21,198 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-22 00:33:21,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-22 00:33:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-11-22 00:33:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 00:33:21,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:21,200 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-22 00:33:21,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:33:21,200 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash -744667383, now seen corresponding path program 1 times [2022-11-22 00:33:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28593863] [2022-11-22 00:33:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:33:21,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28593863] [2022-11-22 00:33:21,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28593863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:21,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:21,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720488298] [2022-11-22 00:33:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:21,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:21,273 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:33:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:21,317 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-22 00:33:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:21,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-11-22 00:33:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:21,319 INFO L225 Difference]: With dead ends: 44 [2022-11-22 00:33:21,319 INFO L226 Difference]: Without dead ends: 42 [2022-11-22 00:33:21,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:33:21,320 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:21,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-22 00:33:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-22 00:33:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-22 00:33:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-11-22 00:33:21,326 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 30 [2022-11-22 00:33:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:21,326 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-11-22 00:33:21,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:33:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-11-22 00:33:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 00:33:21,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:21,328 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-22 00:33:21,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:33:21,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1503821664, now seen corresponding path program 1 times [2022-11-22 00:33:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:21,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374840322] [2022-11-22 00:33:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:33:21,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:21,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374840322] [2022-11-22 00:33:21,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374840322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:21,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455931507] [2022-11-22 00:33:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:21,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:21,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:21,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:33:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:21,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:33:21,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:21,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:33:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455931507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:33:21,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1309786393] [2022-11-22 00:33:21,697 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 00:33:21,697 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:33:21,702 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:33:21,709 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:33:21,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:33:21,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:22,036 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-22 00:33:22,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-11-22 00:33:22,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:22,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:22,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 00:33:22,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:22,171 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 00:33:22,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-22 00:33:22,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:22,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:22,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:22,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-22 00:33:22,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:22,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:22,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2022-11-22 00:33:24,653 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 84 for LOIs [2022-11-22 00:33:24,675 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 121 for LOIs [2022-11-22 00:33:24,770 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:33:32,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1309786393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:32,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:33:32,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 3, 3] total 26 [2022-11-22 00:33:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813948886] [2022-11-22 00:33:32,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:32,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 00:33:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 00:33:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-22 00:33:32,854 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:33:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:33,828 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-22 00:33:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 00:33:33,829 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-11-22 00:33:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:33,830 INFO L225 Difference]: With dead ends: 69 [2022-11-22 00:33:33,830 INFO L226 Difference]: Without dead ends: 41 [2022-11-22 00:33:33,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-22 00:33:33,831 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:33,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 103 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:33:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-22 00:33:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-22 00:33:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 00:33:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-11-22 00:33:33,841 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2022-11-22 00:33:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:33,841 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-11-22 00:33:33,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:33:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-11-22 00:33:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 00:33:33,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:33,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:33,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:33:34,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:33:34,049 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-22 00:33:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash 504972015, now seen corresponding path program 1 times [2022-11-22 00:33:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:34,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433409084] [2022-11-22 00:33:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:34,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 00:33:34,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433409084] [2022-11-22 00:33:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433409084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645020292] [2022-11-22 00:33:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:34,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:34,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:33:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:34,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:33:34,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:34,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:33:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 00:33:34,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645020292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:33:34,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [229642252] [2022-11-22 00:33:34,382 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 00:33:34,383 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:33:34,383 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:33:34,383 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:33:34,384 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:33:34,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:34,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:34,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:34,583 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-22 00:33:34,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-11-22 00:33:34,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:34,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-22 00:33:34,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:34,681 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-22 00:33:34,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-22 00:33:34,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:34,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-22 00:33:34,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:34,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:34,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:34,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-22 00:33:34,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:34,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:35,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:35,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-22 00:33:35,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:35,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 00:33:35,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:33:35,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2022-11-22 00:33:36,691 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 139 for LOIs [2022-11-22 00:33:36,794 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-11-22 00:33:36,801 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:33:45,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [229642252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:45,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:33:45,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 3, 3] total 27 [2022-11-22 00:33:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365679415] [2022-11-22 00:33:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:45,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 00:33:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 00:33:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:33:45,839 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:33:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:46,768 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-11-22 00:33:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 00:33:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-11-22 00:33:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:46,770 INFO L225 Difference]: With dead ends: 41 [2022-11-22 00:33:46,770 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:33:46,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-22 00:33:46,775 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:46,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:33:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:33:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:33:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:33:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:33:46,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-11-22 00:33:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:46,777 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:33:46,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 00:33:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:33:46,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:33:46,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-11-22 00:33:46,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-11-22 00:33:46,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-11-22 00:33:46,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-11-22 00:33:46,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-11-22 00:33:46,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-11-22 00:33:46,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-11-22 00:33:46,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-11-22 00:33:46,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-11-22 00:33:46,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-11-22 00:33:46,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-11-22 00:33:46,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-11-22 00:33:46,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:33:46,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 00:33:46,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:33:55,146 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-22 00:33:55,147 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-22 00:33:55,147 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-22 00:33:55,147 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-22 00:33:55,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-22 00:33:55,148 INFO L895 garLoopResultBuilder]: At program point L1567(line 1567) the Hoare annotation is: (let ((.cse0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|) 2147483648))) (and (<= 0 .cse0) (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (<= .cse0 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|) (= ~globalArgc~0 0) (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1) (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-22 00:33:55,148 INFO L899 garLoopResultBuilder]: For program point L1567-1(lines 1557 1569) no Hoare annotation was computed. [2022-11-22 00:33:55,149 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (and (<= 0 (+ .cse0 2147483648)) (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= .cse0 2147483646) (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse0) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|) (= ~globalArgc~0 0) (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1) (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-22 00:33:55,149 INFO L899 garLoopResultBuilder]: For program point L1559(lines 1559 1568) no Hoare annotation was computed. [2022-11-22 00:33:55,149 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-11-22 00:33:55,149 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-22 00:33:55,150 INFO L899 garLoopResultBuilder]: For program point L1580-3(line 1580) no Hoare annotation was computed. [2022-11-22 00:33:55,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-22 00:33:55,151 INFO L895 garLoopResultBuilder]: At program point L1580-4(lines 1580 1587) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_goodG2B_~j~0#1| 1)) (.cse12 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 3) 0)) (.cse20 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse35 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse39 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= .cse39 2147483646) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse39) (<= 0 (+ .cse39 2147483648)) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0)))))) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse36 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse37 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= ~globalArgv~0.offset 0)) (.cse7 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse8 (= (select |#valid| 3) 1)) (.cse9 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse13 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse14 (= (select |#valid| 4) 1)) (.cse15 (= (select |#length| 3) 18)) (.cse16 (= (select |#valid| 1) 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse18 (= ~globalArgv~0.base 0)) (.cse19 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse21 (= (select |#valid| 0) 0)) (.cse22 (= 54 (select |#length| 2))) (.cse23 (= (select |#length| 1) 1)) (.cse24 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse38 (+ (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) 2147483648))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= 0 .cse38) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (<= .cse38 0) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0)))))) (.cse25 (= (select |#valid| 2) 1)) (.cse26 (= 16 (select |#length| 4))) (.cse27 (= |#NULL.offset| 0)) (.cse28 (= ~globalFalse~0 0)) (.cse29 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse30 (= ~globalArgc~0 0)) (.cse31 (= 5 ~globalFive~0)) (.cse32 (< 0 |#StackHeapBarrier|)) (.cse33 (= |#NULL.base| 0)) (.cse34 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse36 .cse2 .cse3 .cse37 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse36 .cse2 .cse3 .cse37 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) [2022-11-22 00:33:55,151 INFO L899 garLoopResultBuilder]: For program point L1576-3(line 1576) no Hoare annotation was computed. [2022-11-22 00:33:55,152 INFO L899 garLoopResultBuilder]: For program point L1576-4(line 1576) no Hoare annotation was computed. [2022-11-22 00:33:55,153 INFO L895 garLoopResultBuilder]: At program point L1576-5(lines 1576 1579) the Hoare annotation is: (let ((.cse0 (<= |#NULL.offset| 0)) (.cse1 (<= 0 ~globalArgv~0.base)) (.cse2 (<= ~globalArgv~0.base 0)) (.cse4 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse7 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0)) (.cse3 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select (select |#memory_int| 1) 0) 0)) (.cse34 (= |ULTIMATE.start_goodG2B_~data~1#1| 0)) (.cse11 (= (select |#valid| 3) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse16 (= (select |#valid| 4) 1)) (.cse17 (= (select |#length| 3) 18)) (.cse18 (= (select |#valid| 1) 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse20 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse21 (= (select |#valid| 0) 0)) (.cse35 (= |ULTIMATE.start_goodG2B_~h~0#1| 0)) (.cse22 (= 54 (select |#length| 2))) (.cse23 (= (select |#length| 1) 1)) (.cse25 (= (select |#valid| 2) 1)) (.cse26 (= 16 (select |#length| 4))) (.cse28 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse29 (= ~globalArgc~0 0)) (.cse30 (= 5 ~globalFive~0)) (.cse31 (< 0 |#StackHeapBarrier|)) (.cse32 (= |#NULL.base| 0)) (.cse33 (= ~globalTrue~0 1)) (.cse37 (<= 0 |#NULL.offset|))) (or (and .cse0 .cse1 .cse2 (let ((.cse9 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse24 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse36 (+ (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) 2147483648))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= 0 .cse36) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (<= .cse36 0) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0)))))) (.cse27 (= ~globalFalse~0 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse3 .cse5 .cse6 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33))) .cse37) (and (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse0 (<= 1 ~GLOBAL_CONST_TRUE~0) (<= 0 ~globalFalse~0) .cse1 .cse2 (let ((.cse38 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse39 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= .cse39 2147483646) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse39) (<= 0 (+ .cse39 2147483648)) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0))))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse38 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse3 .cse5 .cse6 .cse8 .cse34 .cse11 .cse13 .cse14 .cse38 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33))) (<= 0 ~globalArgv~0.offset) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse37))) [2022-11-22 00:33:55,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-22 00:33:55,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 00:33:55,154 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 00:33:55,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-22 00:33:55,154 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-22 00:33:55,155 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse2 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select (select |#memory_int| 1) 0) 0)) (.cse6 (= ~globalArgv~0.offset 0)) (.cse7 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse8 (= (select |#valid| 3) 1)) (.cse9 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse13 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 3) 0)) (.cse14 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse15 (= (select |#valid| 4) 1)) (.cse16 (= (select |#length| 3) 18)) (.cse17 (= (select |#valid| 1) 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse19 (= ~globalArgv~0.base 0)) (.cse20 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse21 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= 54 (select |#length| 2))) (.cse24 (= (select |#length| 1) 1)) (.cse25 (= (select |#valid| 2) 1)) (.cse26 (= 16 (select |#length| 4))) (.cse27 (= |#NULL.offset| 0)) (.cse28 (= ~globalFalse~0 0)) (.cse29 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse30 (= ~globalArgc~0 0)) (.cse31 (= 5 ~globalFive~0)) (.cse32 (< 0 |#StackHeapBarrier|)) (.cse33 (= |#NULL.base| 0)) (.cse34 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse12 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= .cse12 2147483646) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse12) (<= 0 (+ .cse12 2147483648)) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0))))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse35 (+ (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) 2147483648))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= 0 .cse35) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (<= .cse35 0) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) [2022-11-22 00:33:55,156 INFO L899 garLoopResultBuilder]: For program point L1585-1(lines 1580 1587) no Hoare annotation was computed. [2022-11-22 00:33:55,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-22 00:33:55,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-22 00:33:55,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:33:55,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-22 00:33:55,157 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-11-22 00:33:55,157 INFO L899 garLoopResultBuilder]: For program point L1561-1(line 1561) no Hoare annotation was computed. [2022-11-22 00:33:55,157 INFO L899 garLoopResultBuilder]: For program point L1557-2(line 1557) no Hoare annotation was computed. [2022-11-22 00:33:55,157 INFO L899 garLoopResultBuilder]: For program point L1557-3(line 1557) no Hoare annotation was computed. [2022-11-22 00:33:55,158 INFO L895 garLoopResultBuilder]: At program point L1557-4(lines 1557 1569) the Hoare annotation is: (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (let ((.cse18 (+ .cse22 2147483648))) (let ((.cse0 (<= 0 .cse18)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= (select |#valid| 3) 1)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse8 (= (select |#valid| 4) 1)) (.cse9 (= (select |#length| 3) 18)) (.cse10 (= (select |#valid| 1) 1)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse12 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse13 (= (select |#valid| 0) 0)) (.cse14 (= 54 (select |#length| 2))) (.cse15 (= (select |#length| 1) 1)) (.cse16 (= (select |#valid| 2) 1)) (.cse17 (= 16 (select |#length| 4))) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse20 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse21 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (= ~GLOBAL_CONST_FALSE~0 0) .cse1 .cse2 .cse3 .cse4 (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) .cse5 (= ~GLOBAL_CONST_TRUE~0 1) .cse6 .cse7 (= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse8 .cse9 .cse10 .cse11 (= ~globalArgv~0.base 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |#NULL.offset| 0) (<= .cse18 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse19 (= ~globalArgc~0 0) .cse20 (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) .cse21 (= |#NULL.base| 0) (= ~globalTrue~0 1)) (and (or (and .cse0 .cse1 .cse2 (<= .cse22 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_goodB2G_~result~0#1| .cse22) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) (and .cse0 (= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21)) (let ((.cse23 (<= 0 ~GLOBAL_CONST_FALSE~0)) (.cse24 (<= ~globalTrue~0 1)) (.cse25 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|)) (.cse26 (<= ~globalArgc~0 0)) (.cse27 (<= 0 |#NULL.base|)) (.cse28 (<= 5 ~globalFive~0)) (.cse29 (<= 5 ~GLOBAL_CONST_FIVE~0)) (.cse30 (<= ~GLOBAL_CONST_TRUE~0 1)) (.cse31 (<= ~globalArgv~0.offset 0)) (.cse32 (<= ~globalFalse~0 0)) (.cse33 (<= ~GLOBAL_CONST_FIVE~0 5)) (.cse34 (<= |#NULL.offset| 0)) (.cse35 (<= 1 ~GLOBAL_CONST_TRUE~0)) (.cse36 (<= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse37 (<= 0 ~globalFalse~0)) (.cse38 (<= 0 ~globalArgc~0)) (.cse39 (<= 0 ~globalArgv~0.base)) (.cse40 (<= |#NULL.base| 0)) (.cse41 (<= ~globalArgv~0.base 0)) (.cse42 (<= ~GLOBAL_CONST_FALSE~0 0)) (.cse43 (<= 0 ~globalArgv~0.offset)) (.cse44 (<= 1 ~globalTrue~0)) (.cse45 (<= 0 |#NULL.offset|)) (.cse46 (<= ~globalFive~0 5)) (.cse47 (<= 0 |ULTIMATE.start_goodB2G_~#data~0#1.offset|)) (.cse48 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1))) (or (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 |ULTIMATE.start_goodB2G_~k~0#1|) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse45 .cse46 .cse47 .cse48))) (<= .cse22 2147483647)))))) [2022-11-22 00:33:55,159 INFO L899 garLoopResultBuilder]: For program point L1553-3(line 1553) no Hoare annotation was computed. [2022-11-22 00:33:55,159 INFO L899 garLoopResultBuilder]: For program point L1553-4(line 1553) no Hoare annotation was computed. [2022-11-22 00:33:55,160 INFO L895 garLoopResultBuilder]: At program point L1553-5(lines 1553 1556) the Hoare annotation is: (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (and (let ((.cse0 (<= 0 ~GLOBAL_CONST_FALSE~0)) (.cse1 (<= ~globalTrue~0 1)) (.cse2 (<= ~globalArgc~0 0)) (.cse3 (<= 0 |#NULL.base|)) (.cse4 (<= 5 ~globalFive~0)) (.cse5 (<= 5 ~GLOBAL_CONST_FIVE~0)) (.cse6 (<= ~GLOBAL_CONST_TRUE~0 1)) (.cse7 (<= ~globalArgv~0.offset 0)) (.cse8 (<= ~globalFalse~0 0)) (.cse9 (<= ~GLOBAL_CONST_FIVE~0 5)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= 1 ~GLOBAL_CONST_TRUE~0)) (.cse12 (<= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse13 (<= 0 ~globalFalse~0)) (.cse14 (<= 0 ~globalArgc~0)) (.cse15 (<= 0 ~globalArgv~0.base)) (.cse16 (<= |#NULL.base| 0)) (.cse17 (<= ~globalArgv~0.base 0)) (.cse18 (<= ~GLOBAL_CONST_FALSE~0 0)) (.cse19 (<= 0 ~globalArgv~0.offset)) (.cse20 (<= 1 ~globalTrue~0)) (.cse21 (<= 0 |#NULL.offset|)) (.cse22 (<= ~globalFive~0 5)) (.cse23 (<= 0 |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G_~i~1#1|) .cse13 .cse14 (<= |ULTIMATE.start_goodB2G_~i~1#1| 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1)))) (let ((.cse25 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse26 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse27 (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse28 (= (select (select |#memory_int| 1) 0) 0)) (.cse29 (= (select |#valid| 3) 1)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse32 (= (select |#valid| 4) 1)) (.cse33 (= (select |#length| 3) 18)) (.cse34 (= (select |#valid| 1) 1)) (.cse35 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse36 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= 54 (select |#length| 2))) (.cse39 (= (select |#length| 1) 1)) (.cse40 (= (select |#valid| 2) 1)) (.cse41 (= 16 (select |#length| 4))) (.cse42 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse43 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse44 (< 0 |#StackHeapBarrier|))) (or (and (<= 0 (+ .cse24 2147483648)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse42 .cse43 .cse44) (and .cse25 .cse26 .cse27 .cse28 (= .cse24 0) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))) (<= .cse24 2147483647))) [2022-11-22 00:33:55,160 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-22 00:33:55,160 INFO L902 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: true [2022-11-22 00:33:55,161 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-22 00:33:55,161 INFO L902 garLoopResultBuilder]: At program point L1599-1(line 1599) the Hoare annotation is: true [2022-11-22 00:33:55,161 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-22 00:33:55,161 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-22 00:33:55,161 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-22 00:33:55,162 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-22 00:33:55,166 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:55,169 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:33:55,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,226 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,226 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,226 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,227 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,227 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,227 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,236 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,236 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,236 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,237 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,238 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,242 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,243 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,246 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,249 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,250 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,259 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,260 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,261 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,261 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,261 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,262 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,262 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,262 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,263 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,263 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,263 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,264 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,264 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,267 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,267 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,268 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,268 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,268 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,269 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,269 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,269 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,270 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,270 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,271 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,271 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,271 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,273 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,274 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,274 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:33:55 BoogieIcfgContainer [2022-11-22 00:33:55,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:33:55,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:33:55,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:33:55,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:33:55,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:17" (3/4) ... [2022-11-22 00:33:55,293 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:33:55,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-22 00:33:55,300 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-22 00:33:55,306 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-22 00:33:55,306 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-22 00:33:55,307 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 00:33:55,307 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:33:55,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= i) && 0 <= globalFalse) && 0 <= globalArgc) && i <= 0) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) || (((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1)) && ((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((((argv == argv && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && unknown-#memory_int-unknown[data][data] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown))) && unknown-#memory_int-unknown[data][data] <= 2147483647 [2022-11-22 00:33:55,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && unknown-#memory_int-unknown[data][data] + 2147483648 <= 0) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[data][data] <= 2147483646) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && result == unknown-#memory_int-unknown[data][data]) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown)) && ((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && k <= 0) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && 0 <= k) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1) || (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1))) && unknown-#memory_int-unknown[data][data] <= 2147483647) [2022-11-22 00:33:55,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((#NULL <= 0 && 0 <= globalArgv) && globalArgv <= 0) && (((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 0 <= #NULL) || ((((((((((((((5 <= GLOBAL_CONST_FIVE && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && ((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && data == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) [2022-11-22 00:33:55,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-11-22 00:33:55,354 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:33:55,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:33:55,355 INFO L158 Benchmark]: Toolchain (without parser) took 40805.93ms. Allocated memory was 125.8MB in the beginning and 281.0MB in the end (delta: 155.2MB). Free memory was 67.0MB in the beginning and 81.8MB in the end (delta: -14.8MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2022-11-22 00:33:55,356 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:33:55,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1572.00ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 66.7MB in the beginning and 79.7MB in the end (delta: -13.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-11-22 00:33:55,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.64ms. Allocated memory is still 159.4MB. Free memory was 79.7MB in the beginning and 124.1MB in the end (delta: -44.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-22 00:33:55,357 INFO L158 Benchmark]: Boogie Preprocessor took 73.68ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:33:55,357 INFO L158 Benchmark]: RCFGBuilder took 802.46ms. Allocated memory is still 159.4MB. Free memory was 122.0MB in the beginning and 104.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-22 00:33:55,358 INFO L158 Benchmark]: TraceAbstraction took 38123.83ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 103.2MB in the beginning and 85.0MB in the end (delta: 18.2MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. [2022-11-22 00:33:55,358 INFO L158 Benchmark]: Witness Printer took 66.87ms. Allocated memory is still 281.0MB. Free memory was 85.0MB in the beginning and 81.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:33:55,360 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1572.00ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 66.7MB in the beginning and 79.7MB in the end (delta: -13.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.64ms. Allocated memory is still 159.4MB. Free memory was 79.7MB in the beginning and 124.1MB in the end (delta: -44.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.68ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 802.46ms. Allocated memory is still 159.4MB. Free memory was 122.0MB in the beginning and 104.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 38123.83ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 103.2MB in the beginning and 85.0MB in the end (delta: 18.2MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. * Witness Printer took 66.87ms. Allocated memory is still 281.0MB. Free memory was 85.0MB in the beginning and 81.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 37.9s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 1072 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 673 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1126 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 399 mSDtfsCounter, 1126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 222 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 88, 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, 14 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 50 NumberOfFragments, 3096 HoareAnnotationTreeSize, 31 FomulaSimplifications, 84 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 5186 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 888 SizeOfPredicates, 3 NumberOfNonLiveVariables, 849 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 96/113 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 5.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 64, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 104, TOOLS_POST_TIME: 3.4s, TOOLS_POST_CALL_APPLICATIONS: 26, TOOLS_POST_CALL_TIME: 0.6s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 142, TOOLS_QUANTIFIERELIM_TIME: 4.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 224, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 0.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 64, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 0.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 2873, DAG_COMPRESSION_RETAINED_NODES: 230, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant [2022-11-22 00:33:55,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,428 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,429 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,431 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,431 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,431 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,432 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,432 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,433 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,433 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,434 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,434 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,434 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,436 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] Derived loop invariant: ((((#NULL <= 0 && 0 <= globalArgv) && globalArgv <= 0) && (((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 0 <= #NULL) || ((((((((((((((5 <= GLOBAL_CONST_FIVE && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && ((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && data == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) - InvariantResult [Line: 1580]: Loop Invariant [2022-11-22 00:33:55,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,440 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,440 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,440 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,445 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,445 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,445 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,446 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,446 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,447 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,447 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,447 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,451 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,451 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,451 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,451 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,452 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,452 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,452 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,452 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,455 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,455 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,456 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,456 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,456 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,456 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,457 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,457 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,457 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,458 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,458 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,458 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,461 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,461 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,461 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,462 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,462 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,462 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,463 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,463 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,463 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-11-22 00:33:55,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-11-22 00:33:55,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && data + 3 == 0) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483646) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] + 2147483648) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] + 2147483648 <= 0) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) - InvariantResult [Line: 1599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= i) && 0 <= globalFalse) && 0 <= globalArgc) && i <= 0) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) || (((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1)) && ((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((((argv == argv && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && unknown-#memory_int-unknown[data][data] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown))) && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && globalArgv == 0) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && unknown-#memory_int-unknown[data][data] + 2147483648 <= 0) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[data][data] <= 2147483646) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && result == unknown-#memory_int-unknown[data][data]) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown)) && ((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && k <= 0) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && 0 <= k) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1) || (((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1))) && unknown-#memory_int-unknown[data][data] <= 2147483647) RESULT: Ultimate proved your program to be correct! [2022-11-22 00:33:55,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab40180-b0cf-493e-a9b8-808bb5704cbc/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE