./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_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_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/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_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/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_5eca2796-c621-40c5-8613-af294d71c2d0/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 b3bbea65b78857147395889e1e5ad1fa76207cd1b4b81931c14c2d75d9d48b06 --- 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 01:22:39,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:22:39,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:22:39,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:22:39,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:22:39,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:22:39,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:22:39,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:22:39,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:22:39,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:22:39,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:22:39,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:22:39,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:22:39,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:22:39,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:22:39,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:22:39,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:22:39,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:22:39,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:22:39,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:22:39,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:22:39,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:22:39,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:22:39,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:22:39,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:22:39,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:22:39,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:22:39,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:22:39,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:22:39,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:22:39,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:22:39,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:22:39,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:22:39,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:22:39,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:22:39,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:22:39,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:22:39,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:22:39,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:22:39,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:22:39,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:22:39,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 01:22:39,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:22:39,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:22:39,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:22:39,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:22:39,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:22:39,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:22:39,792 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:22:39,792 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:22:39,793 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:22:39,793 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:22:39,794 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:22:39,795 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:22:39,795 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:22:39,795 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:22:39,796 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:22:39,796 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:22:39,796 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:22:39,797 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:22:39,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:22:39,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:22:39,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:22:39,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:22:39,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:22:39,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:22:39,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:22:39,800 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:22:39,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:22:39,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:22:39,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:22:39,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:22:39,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:22:39,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:22:39,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:22:39,803 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:22:39,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:22:39,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:22:39,804 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:22:39,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:22:39,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:22:39,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:22:39,806 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_5eca2796-c621-40c5-8613-af294d71c2d0/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_5eca2796-c621-40c5-8613-af294d71c2d0/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 -> b3bbea65b78857147395889e1e5ad1fa76207cd1b4b81931c14c2d75d9d48b06 [2022-11-22 01:22:40,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:22:40,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:22:40,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:22:40,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:22:40,163 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:22:40,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i [2022-11-22 01:22:43,578 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:22:44,081 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:22:44,082 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i [2022-11-22 01:22:44,120 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/data/7ea0b7ef1/2b6bd7fc59744bb0a4e1998103b9a1ba/FLAG18c8821dc [2022-11-22 01:22:44,137 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/data/7ea0b7ef1/2b6bd7fc59744bb0a4e1998103b9a1ba [2022-11-22 01:22:44,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:22:44,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:22:44,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:22:44,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:22:44,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:22:44,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:22:44" (1/1) ... [2022-11-22 01:22:44,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74471c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:44, skipping insertion in model container [2022-11-22 01:22:44,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:22:44" (1/1) ... [2022-11-22 01:22:44,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:22:44,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:22:44,717 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 01:22:45,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:22:45,674 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:22:45,711 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 01:22:45,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:22:46,011 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:22:46,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46 WrapperNode [2022-11-22 01:22:46,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:22:46,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:22:46,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:22:46,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:22:46,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,121 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2022-11-22 01:22:46,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:22:46,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:22:46,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:22:46,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:22:46,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,166 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:22:46,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:22:46,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:22:46,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:22:46,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (1/1) ... [2022-11-22 01:22:46,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:22:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:46,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:22:46,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:22:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-22 01:22:46,296 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-22 01:22:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-22 01:22:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-22 01:22:46,297 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-22 01:22:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-22 01:22:46,297 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-22 01:22:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:22:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-22 01:22:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:22:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:22:46,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:22:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:22:46,299 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-22 01:22:46,299 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-22 01:22:46,299 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-22 01:22:46,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:22:46,493 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:22:46,496 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:22:46,871 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:22:46,924 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:22:46,925 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:22:46,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:46 BoogieIcfgContainer [2022-11-22 01:22:46,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:22:46,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:22:46,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:22:46,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:22:46,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:22:44" (1/3) ... [2022-11-22 01:22:46,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cc6af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:22:46, skipping insertion in model container [2022-11-22 01:22:46,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:22:46" (2/3) ... [2022-11-22 01:22:46,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cc6af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:22:46, skipping insertion in model container [2022-11-22 01:22:46,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:46" (3/3) ... [2022-11-22 01:22:46,942 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_11_good.i [2022-11-22 01:22:46,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:22:46,968 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-22 01:22:47,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:22:47,043 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;@4d834adf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:22:47,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-22 01:22:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-22 01:22:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:22:47,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:47,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:47,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1518909130, now seen corresponding path program 1 times [2022-11-22 01:22:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:47,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562056736] [2022-11-22 01:22:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:47,657 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 01:22:47,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:47,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562056736] [2022-11-22 01:22:47,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562056736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:47,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:47,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:22:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360737477] [2022-11-22 01:22:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:47,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:22:47,724 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 01:22:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:47,829 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-22 01:22:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:47,832 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-22 01:22:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:47,844 INFO L225 Difference]: With dead ends: 137 [2022-11-22 01:22:47,844 INFO L226 Difference]: Without dead ends: 68 [2022-11-22 01:22:47,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:22:47,853 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:47,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:22:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-22 01:22:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-22 01:22:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-22 01:22:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-22 01:22:47,926 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-22 01:22:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:47,928 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-22 01:22:47,929 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 01:22:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-22 01:22:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:22:47,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:47,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:47,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:22:47,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1228629103, now seen corresponding path program 1 times [2022-11-22 01:22:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:47,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62515135] [2022-11-22 01:22:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:48,081 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 01:22:48,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:48,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62515135] [2022-11-22 01:22:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62515135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:48,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:48,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:22:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951730283] [2022-11-22 01:22:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:48,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:22:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:22:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:22:48,086 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 01:22:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:48,122 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-11-22 01:22:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:22:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2022-11-22 01:22:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:48,125 INFO L225 Difference]: With dead ends: 68 [2022-11-22 01:22:48,125 INFO L226 Difference]: Without dead ends: 67 [2022-11-22 01:22:48,125 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 01:22:48,127 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:48,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-22 01:22:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-22 01:22:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-22 01:22:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-11-22 01:22:48,141 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-11-22 01:22:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:48,141 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-11-22 01:22:48,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 01:22:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-11-22 01:22:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:22:48,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:48,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:48,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:22:48,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -567203394, now seen corresponding path program 1 times [2022-11-22 01:22:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:48,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609300777] [2022-11-22 01:22:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:48,312 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 01:22:48,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:48,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609300777] [2022-11-22 01:22:48,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609300777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:48,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:48,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:22:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717377017] [2022-11-22 01:22:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:48,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:48,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:48,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:48,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:22:48,316 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 01:22:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:48,409 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-22 01:22:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:48,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2022-11-22 01:22:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:48,413 INFO L225 Difference]: With dead ends: 67 [2022-11-22 01:22:48,414 INFO L226 Difference]: Without dead ends: 66 [2022-11-22 01:22:48,414 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 01:22:48,416 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:48,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 174 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:22:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-22 01:22:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-22 01:22:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.368421052631579) internal successors, (52), 51 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-22 01:22:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-22 01:22:48,447 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 20 [2022-11-22 01:22:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:48,448 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-22 01:22:48,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 01:22:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-22 01:22:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:22:48,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:48,450 INFO L195 NwaCegarLoop]: trace histogram [3, 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 01:22:48,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:22:48,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1147666448, now seen corresponding path program 1 times [2022-11-22 01:22:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:48,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047766660] [2022-11-22 01:22:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 01:22:48,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:48,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047766660] [2022-11-22 01:22:48,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047766660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:48,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:48,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:22:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36520969] [2022-11-22 01:22:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:48,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:22:48,642 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:22:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:48,716 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2022-11-22 01:22:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2022-11-22 01:22:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:48,718 INFO L225 Difference]: With dead ends: 114 [2022-11-22 01:22:48,718 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 01:22:48,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:22:48,721 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:48,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 01:22:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-22 01:22:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 50 states have internal predecessors, (51), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 01:22:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-11-22 01:22:48,735 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 33 [2022-11-22 01:22:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:48,736 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-11-22 01:22:48,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:22:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-11-22 01:22:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:22:48,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:48,738 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-22 01:22:48,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:22:48,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:48,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1355647169, now seen corresponding path program 1 times [2022-11-22 01:22:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:48,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405510030] [2022-11-22 01:22:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:22:48,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405510030] [2022-11-22 01:22:48,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405510030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913796442] [2022-11-22 01:22:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:48,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:48,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:22:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:49,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:22:49,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:22:49,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:22:49,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913796442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:49,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:22:49,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 01:22:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733978929] [2022-11-22 01:22:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:49,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:22:49,099 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:22:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:49,150 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2022-11-22 01:22:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-11-22 01:22:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:49,152 INFO L225 Difference]: With dead ends: 106 [2022-11-22 01:22:49,153 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 01:22:49,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:22:49,155 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:49,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 01:22:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-22 01:22:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 50 states have internal predecessors, (50), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 01:22:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-11-22 01:22:49,166 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 34 [2022-11-22 01:22:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:49,167 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-22 01:22:49,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:22:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-11-22 01:22:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:22:49,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:49,169 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:49,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:22:49,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:49,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash -28075386, now seen corresponding path program 1 times [2022-11-22 01:22:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901952418] [2022-11-22 01:22:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 01:22:49,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:49,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901952418] [2022-11-22 01:22:49,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901952418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:49,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:49,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:22:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382664895] [2022-11-22 01:22:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:49,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:22:49,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:49,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:22:49,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:22:49,614 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-22 01:22:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:49,659 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-11-22 01:22:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:22:49,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 36 [2022-11-22 01:22:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:49,664 INFO L225 Difference]: With dead ends: 65 [2022-11-22 01:22:49,665 INFO L226 Difference]: Without dead ends: 64 [2022-11-22 01:22:49,665 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 01:22:49,675 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:49,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-22 01:22:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-22 01:22:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 49 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 01:22:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-11-22 01:22:49,692 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 36 [2022-11-22 01:22:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:49,695 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-11-22 01:22:49,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-22 01:22:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-11-22 01:22:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 01:22:49,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:49,701 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:22:49,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash -870336855, now seen corresponding path program 1 times [2022-11-22 01:22:49,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:49,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506420848] [2022-11-22 01:22:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:49,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 01:22:49,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506420848] [2022-11-22 01:22:49,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506420848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:49,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:49,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:22:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889556739] [2022-11-22 01:22:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:22:49,859 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:22:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:49,910 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-11-22 01:22:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-11-22 01:22:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:49,912 INFO L225 Difference]: With dead ends: 64 [2022-11-22 01:22:49,913 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 01:22:49,913 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 01:22:49,914 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:49,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 178 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 01:22:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-22 01:22:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 48 states have internal predecessors, (48), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 01:22:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-11-22 01:22:49,925 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2022-11-22 01:22:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:49,925 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-11-22 01:22:49,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:22:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-11-22 01:22:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 01:22:49,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:49,927 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:22:49,927 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -586911336, now seen corresponding path program 1 times [2022-11-22 01:22:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398958437] [2022-11-22 01:22:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 01:22:50,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398958437] [2022-11-22 01:22:50,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398958437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848860935] [2022-11-22 01:22:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:50,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:50,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:50,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:50,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:22:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:50,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:22:50,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:22:50,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:22:50,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848860935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:50,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:22:50,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 01:22:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847239987] [2022-11-22 01:22:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:50,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:22:50,303 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 01:22:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:50,350 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-11-22 01:22:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:50,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-11-22 01:22:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:50,352 INFO L225 Difference]: With dead ends: 94 [2022-11-22 01:22:50,352 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 01:22:50,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:22:50,354 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:50,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 01:22:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-22 01:22:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.236842105263158) internal successors, (47), 47 states have internal predecessors, (47), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 01:22:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-22 01:22:50,364 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 46 [2022-11-22 01:22:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:50,364 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-22 01:22:50,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 01:22:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2022-11-22 01:22:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 01:22:50,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:50,367 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:50,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:22:50,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:50,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1577974785, now seen corresponding path program 1 times [2022-11-22 01:22:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:50,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134136007] [2022-11-22 01:22:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-22 01:22:50,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:50,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134136007] [2022-11-22 01:22:50,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134136007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:50,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:22:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090305243] [2022-11-22 01:22:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:50,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:22:50,677 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 01:22:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:50,732 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2022-11-22 01:22:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 50 [2022-11-22 01:22:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:50,736 INFO L225 Difference]: With dead ends: 80 [2022-11-22 01:22:50,736 INFO L226 Difference]: Without dead ends: 78 [2022-11-22 01:22:50,743 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 01:22:50,746 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:50,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-22 01:22:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-11-22 01:22:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 50 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-22 01:22:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-11-22 01:22:50,765 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 50 [2022-11-22 01:22:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:50,780 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-11-22 01:22:50,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 01:22:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-11-22 01:22:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-22 01:22:50,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:50,787 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:50,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:22:50,788 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1001422755, now seen corresponding path program 1 times [2022-11-22 01:22:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:50,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976821511] [2022-11-22 01:22:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-22 01:22:50,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:50,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976821511] [2022-11-22 01:22:50,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976821511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:50,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:22:50,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:22:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561911497] [2022-11-22 01:22:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:50,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:22:50,939 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 01:22:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:50,987 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-11-22 01:22:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2022-11-22 01:22:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:50,990 INFO L225 Difference]: With dead ends: 85 [2022-11-22 01:22:50,990 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 01:22:50,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:22:50,994 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:50,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 01:22:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-22 01:22:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 01:22:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-11-22 01:22:51,025 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 53 [2022-11-22 01:22:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:51,026 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-22 01:22:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 01:22:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-11-22 01:22:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-22 01:22:51,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:51,028 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:51,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:22:51,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -402769081, now seen corresponding path program 1 times [2022-11-22 01:22:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:51,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923736338] [2022-11-22 01:22:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:22:51,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:51,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923736338] [2022-11-22 01:22:51,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923736338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:51,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922468808] [2022-11-22 01:22:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:51,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:51,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:51,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:51,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:22:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:51,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:22:51,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-22 01:22:51,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:22:51,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922468808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:22:51,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:22:51,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 01:22:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131032587] [2022-11-22 01:22:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:22:51,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:22:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:22:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:22:51,364 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-22 01:22:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:51,406 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-22 01:22:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:22:51,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2022-11-22 01:22:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:51,408 INFO L225 Difference]: With dead ends: 72 [2022-11-22 01:22:51,408 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 01:22:51,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:22:51,409 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:51,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:22:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 01:22:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-22 01:22:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.131578947368421) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 01:22:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-22 01:22:51,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 60 [2022-11-22 01:22:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:51,419 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-22 01:22:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-22 01:22:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-22 01:22:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-22 01:22:51,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:51,420 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:51,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 01:22:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:51,627 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:22:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2119652869, now seen corresponding path program 1 times [2022-11-22 01:22:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:51,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940595981] [2022-11-22 01:22:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:22:51,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:51,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940595981] [2022-11-22 01:22:51,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940595981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:51,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84828636] [2022-11-22 01:22:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:51,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:51,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:51,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:51,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:22:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:52,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:22:52,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:22:52,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:22:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:22:52,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84828636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:22:52,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1105856757] [2022-11-22 01:22:52,271 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-22 01:22:52,272 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:22:52,277 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:22:52,284 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:22:52,285 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:22:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:52,986 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 01:22:52,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-22 01:22:53,034 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 01:22:53,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:53,088 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 01:22:53,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-22 01:22:53,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:53,402 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 01:22:53,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-22 01:22:53,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:22:53,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:53,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:22:55,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,408 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 01:22:55,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-22 01:22:55,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,790 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 01:22:55,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-22 01:22:55,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:55,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:22:55,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-22 01:22:55,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:22:56,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:22:56,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:56,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:22:59,885 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-22 01:22:59,888 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-22 01:22:59,935 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-22 01:23:00,095 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-22 01:23:00,100 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:23:13,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1105856757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:23:13,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:23:13,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 45 [2022-11-22 01:23:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263736503] [2022-11-22 01:23:13,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:23:13,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 01:23:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:23:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 01:23:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2022-11-22 01:23:13,831 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:23:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:23:21,333 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2022-11-22 01:23:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-22 01:23:21,335 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-11-22 01:23:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:23:21,336 INFO L225 Difference]: With dead ends: 183 [2022-11-22 01:23:21,336 INFO L226 Difference]: Without dead ends: 118 [2022-11-22 01:23:21,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2022-11-22 01:23:21,339 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 175 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:23:21,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 410 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-22 01:23:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-22 01:23:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2022-11-22 01:23:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 71 states have internal predecessors, (72), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 01:23:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2022-11-22 01:23:21,372 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 65 [2022-11-22 01:23:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:23:21,372 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2022-11-22 01:23:21,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:23:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2022-11-22 01:23:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-22 01:23:21,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:23:21,375 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:23:21,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-22 01:23:21,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 01:23:21,577 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:23:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:23:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1886576016, now seen corresponding path program 1 times [2022-11-22 01:23:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:23:21,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610053631] [2022-11-22 01:23:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:23:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:23:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:23:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 01:23:21,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:23:21,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610053631] [2022-11-22 01:23:21,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610053631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:23:21,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369029161] [2022-11-22 01:23:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:23:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:23:21,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:23:21,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:23:21,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:23:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:23:21,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:23:21,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:23:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 01:23:22,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:23:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 01:23:22,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369029161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:23:22,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [218383503] [2022-11-22 01:23:22,120 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-22 01:23:22,120 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:23:22,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:23:22,121 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:23:22,121 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:23:22,374 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 01:23:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:22,576 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 01:23:22,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-22 01:23:22,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:22,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-22 01:23:22,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:22,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-22 01:23:22,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:23:22,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:22,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:23:23,638 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 01:23:23,648 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 01:23:23,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,709 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 01:23:23,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-22 01:23:23,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,791 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:23:23,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-22 01:23:23,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:23,877 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:23:23,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-11-22 01:23:24,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:23:24,142 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-22 01:23:24,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-11-22 01:23:37,161 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-22 01:23:37,163 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-11-22 01:23:37,166 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-22 01:23:37,169 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-22 01:23:37,278 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:24:03,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [218383503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:03,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:24:03,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 45 [2022-11-22 01:24:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240076336] [2022-11-22 01:24:03,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:03,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 01:24:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 01:24:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2022-11-22 01:24:03,667 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:24:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:10,422 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-11-22 01:24:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 01:24:10,422 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-22 01:24:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:10,423 INFO L225 Difference]: With dead ends: 122 [2022-11-22 01:24:10,423 INFO L226 Difference]: Without dead ends: 76 [2022-11-22 01:24:10,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 149 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=285, Invalid=2165, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 01:24:10,425 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 109 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:10,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 430 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-22 01:24:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-22 01:24:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-11-22 01:24:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 47 states have internal predecessors, (47), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 01:24:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2022-11-22 01:24:10,441 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 67 [2022-11-22 01:24:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:10,442 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2022-11-22 01:24:10,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:24:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-11-22 01:24:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-22 01:24:10,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:10,443 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:10,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 01:24:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 01:24:10,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:24:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1373439866, now seen corresponding path program 1 times [2022-11-22 01:24:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:10,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855293582] [2022-11-22 01:24:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 01:24:10,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855293582] [2022-11-22 01:24:10,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855293582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:24:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023166347] [2022-11-22 01:24:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:10,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:24:10,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:24:10,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:24:10,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:24:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:10,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:24:10,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:24:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 01:24:10,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:24:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 01:24:11,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023166347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:24:11,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1824207153] [2022-11-22 01:24:11,051 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-22 01:24:11,051 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:24:11,053 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:24:11,053 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:24:11,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:24:11,261 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 01:24:11,268 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 01:24:11,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:11,306 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 01:24:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-22 01:24:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:11,459 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 01:24:11,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-22 01:24:11,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:11,666 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 01:24:11,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-22 01:24:11,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:11,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:24:12,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,662 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 01:24:12,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-22 01:24:12,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,922 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 01:24:12,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-22 01:24:12,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:12,976 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:24:12,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-22 01:24:13,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:24:13,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:24:13,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:13,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:24:15,730 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-22 01:24:15,732 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-22 01:24:15,871 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-22 01:24:15,968 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-22 01:24:16,082 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:24:34,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1824207153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:24:34,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:24:34,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-22 01:24:34,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284464335] [2022-11-22 01:24:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:24:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-22 01:24:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:24:34,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-22 01:24:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1885, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 01:24:34,345 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:24:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:24:42,168 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-11-22 01:24:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-22 01:24:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-22 01:24:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:24:42,172 INFO L225 Difference]: With dead ends: 136 [2022-11-22 01:24:42,172 INFO L226 Difference]: Without dead ends: 84 [2022-11-22 01:24:42,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 153 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=331, Invalid=2531, Unknown=0, NotChecked=0, Total=2862 [2022-11-22 01:24:42,173 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:24:42,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 245 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-22 01:24:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-22 01:24:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2022-11-22 01:24:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-22 01:24:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-22 01:24:42,199 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 67 [2022-11-22 01:24:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:24:42,200 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-22 01:24:42,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:24:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-22 01:24:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-22 01:24:42,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:24:42,201 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:24:42,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-22 01:24:42,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 01:24:42,412 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 01:24:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:24:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1737733467, now seen corresponding path program 1 times [2022-11-22 01:24:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:24:42,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376130885] [2022-11-22 01:24:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:24:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:24:42,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:24:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376130885] [2022-11-22 01:24:42,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376130885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:24:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144322655] [2022-11-22 01:24:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:24:42,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:24:42,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:24:42,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:24:42,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:24:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:24:42,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:24:42,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:24:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:24:42,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:24:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 01:24:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144322655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:24:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [609335351] [2022-11-22 01:24:42,805 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-22 01:24:42,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:24:42,806 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:24:42,806 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:24:42,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:24:43,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:43,138 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 01:24:43,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-22 01:24:43,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:43,332 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 01:24:43,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-22 01:24:43,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:24:43,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:43,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-22 01:24:43,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:24:43,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:43,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:24:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,372 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 01:24:44,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-22 01:24:44,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,625 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 01:24:44,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-22 01:24:44,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,675 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:24:44,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-22 01:24:44,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:24:44,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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 01:24:44,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:24:44,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-22 01:24:47,379 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-22 01:24:47,381 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-11-22 01:24:47,383 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-22 01:24:47,486 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-22 01:24:47,496 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:25:03,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [609335351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:25:03,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:25:03,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [5, 5, 5] total 47 [2022-11-22 01:25:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607085377] [2022-11-22 01:25:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:25:03,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-22 01:25:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:25:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-22 01:25:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1973, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 01:25:03,940 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:25:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:25:10,171 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-22 01:25:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-22 01:25:10,172 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-11-22 01:25:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:25:10,172 INFO L225 Difference]: With dead ends: 84 [2022-11-22 01:25:10,172 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:25:10,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 156 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=347, Invalid=2733, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 01:25:10,173 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 92 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:25:10,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 119 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-22 01:25:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:25:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:25:10,175 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 01:25:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:25:10,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-22 01:25:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:25:10,175 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:25:10,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:25:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:25:10,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:25:10,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-22 01:25:10,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-22 01:25:10,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-22 01:25:10,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-22 01:25:10,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-22 01:25:10,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-22 01:25:10,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-22 01:25:10,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-22 01:25:10,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 01:25:10,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 01:25:10,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 01:25:35,784 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-22 01:25:35,784 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-22 01:25:35,784 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-22 01:25:35,784 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-22 01:25:35,784 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-22 01:25:35,785 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-22 01:25:35,785 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1606) no Hoare annotation was computed. [2022-11-22 01:25:35,785 INFO L895 garLoopResultBuilder]: At program point L1588(line 1588) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse27 (store ((as const (Array Int Int)) 0) 0 0)) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) .cse27) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-22 01:25:35,786 INFO L899 garLoopResultBuilder]: For program point L1588-1(line 1588) no Hoare annotation was computed. [2022-11-22 01:25:35,786 INFO L899 garLoopResultBuilder]: For program point L1588-2(lines 1588 1601) no Hoare annotation was computed. [2022-11-22 01:25:35,786 INFO L895 garLoopResultBuilder]: At program point L1588-4(lines 1588 1601) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 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|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse12) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-22 01:25:35,787 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 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 |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (store ((as const (Array Int Int)) 0) 0 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1566 1582) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1648) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1581) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: false [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point L1606(line 1606) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2022-11-22 01:25:35,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-22 01:25:35,788 INFO L895 garLoopResultBuilder]: At program point L1664(line 1664) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 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 |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 01:25:35,788 INFO L899 garLoopResultBuilder]: For program point L1664-1(line 1664) no Hoare annotation was computed. [2022-11-22 01:25:35,788 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-22 01:25:35,788 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse12 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= 21 (select |#length| 4))) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= (select |#length| 10) 18)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~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 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1631-1(line 1631) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1598-1(lines 1592 1599) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-22 01:25:35,789 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1582) no Hoare annotation was computed. [2022-11-22 01:25:35,790 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1636) no Hoare annotation was computed. [2022-11-22 01:25:35,790 INFO L895 garLoopResultBuilder]: At program point L1641(line 1641) the Hoare annotation is: (let ((.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse32 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 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|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse20 (store ((as const (Array Int Int)) 0) 0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse53 .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse20) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse55 .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse53 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse55 .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-22 01:25:35,791 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse40 (store ((as const (Array Int Int)) 0) 0 0)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (select |#length| 8) 54)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~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 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse40) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse40) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-11-22 01:25:35,791 INFO L899 garLoopResultBuilder]: For program point L1641-1(line 1641) no Hoare annotation was computed. [2022-11-22 01:25:35,792 INFO L895 garLoopResultBuilder]: At program point L1641-4(lines 1641 1644) the Hoare annotation is: (let ((.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse44 (store ((as const (Array Int Int)) 0) 0 0)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse43 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (= (select |#valid| 10) 1)) (.cse49 (= (select |#valid| 8) 1)) (.cse50 (< 0 |#StackHeapBarrier|)) (.cse51 (= |#NULL.base| 0)) (.cse52 (= ~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 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse44) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse44 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse54 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse55 .cse38 .cse39 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse54 .cse17 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse44) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse55 .cse38 .cse39 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52))) [2022-11-22 01:25:35,792 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-11-22 01:25:35,792 INFO L895 garLoopResultBuilder]: At program point L1633(line 1633) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse21 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse54 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse43 (store ((as const (Array Int Int)) 0) 0 0)) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~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 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse43) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse43 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse52 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse54 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse52 .cse17 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse43) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse54 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse43) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-22 01:25:35,793 INFO L902 garLoopResultBuilder]: At program point L1666-1(line 1666) the Hoare annotation is: true [2022-11-22 01:25:35,793 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1599) no Hoare annotation was computed. [2022-11-22 01:25:35,793 INFO L902 garLoopResultBuilder]: At program point L1650(line 1650) the Hoare annotation is: true [2022-11-22 01:25:35,793 INFO L899 garLoopResultBuilder]: For program point L1584(lines 1584 1615) no Hoare annotation was computed. [2022-11-22 01:25:35,793 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 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 |#valid| 9) 1) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 01:25:35,793 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-22 01:25:35,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1631) no Hoare annotation was computed. [2022-11-22 01:25:35,794 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 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 |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 01:25:35,794 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-22 01:25:35,794 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-11-22 01:25:35,795 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 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 |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |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 (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 01:25:35,795 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-11-22 01:25:35,795 INFO L899 garLoopResultBuilder]: For program point L1602-1(lines 1602 1614) no Hoare annotation was computed. [2022-11-22 01:25:35,795 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 01:25:35,795 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1631) no Hoare annotation was computed. [2022-11-22 01:25:35,796 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1606) no Hoare annotation was computed. [2022-11-22 01:25:35,796 INFO L899 garLoopResultBuilder]: For program point L1628(line 1628) no Hoare annotation was computed. [2022-11-22 01:25:35,796 INFO L899 garLoopResultBuilder]: For program point L1628-1(lines 1628 1635) no Hoare annotation was computed. [2022-11-22 01:25:35,796 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 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 |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 01:25:35,796 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-22 01:25:35,797 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse23 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse19 (store ((as const (Array Int Int)) 0) 0 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= (select |#length| 10) 18)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse19) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse19) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse52 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse53 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse53 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse19) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse19 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse52 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-22 01:25:35,798 INFO L899 garLoopResultBuilder]: For program point L1620-1(line 1620) no Hoare annotation was computed. [2022-11-22 01:25:35,798 INFO L899 garLoopResultBuilder]: For program point L1620-2(lines 1620 1627) no Hoare annotation was computed. [2022-11-22 01:25:35,798 INFO L895 garLoopResultBuilder]: At program point L1620-3(lines 1620 1627) the Hoare annotation is: (let ((.cse50 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse20 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse51 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse53 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse51 .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse20) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 .cse52 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse53 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse52 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse51 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse53 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-22 01:25:35,799 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-22 01:25:35,799 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 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|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse19 (store ((as const (Array Int Int)) 0) 0 0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse19) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse19 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-22 01:25:35,800 INFO L899 garLoopResultBuilder]: For program point L1645-1(lines 1645 1652) no Hoare annotation was computed. [2022-11-22 01:25:35,800 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1648) no Hoare annotation was computed. [2022-11-22 01:25:35,800 INFO L899 garLoopResultBuilder]: For program point L1637(lines 1637 1653) no Hoare annotation was computed. [2022-11-22 01:25:35,800 INFO L899 garLoopResultBuilder]: For program point L1604(lines 1604 1613) no Hoare annotation was computed. [2022-11-22 01:25:35,800 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-22 01:25:35,800 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-22 01:25:35,803 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:25:35,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:25:35,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:25:35 BoogieIcfgContainer [2022-11-22 01:25:35,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:25:35,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:25:35,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:25:35,815 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:25:35,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:22:46" (3/4) ... [2022-11-22 01:25:35,819 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:25:35,824 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-22 01:25:35,824 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-22 01:25:35,824 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-22 01:25:35,825 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-22 01:25:35,830 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-22 01:25:35,830 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-22 01:25:35,831 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 01:25:35,831 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 01:25:35,831 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 01:25:35,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:25:35,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:25:35,875 INFO L158 Benchmark]: Toolchain (without parser) took 171732.81ms. Allocated memory was 132.1MB in the beginning and 465.6MB in the end (delta: 333.4MB). Free memory was 84.8MB in the beginning and 327.7MB in the end (delta: -242.9MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,876 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:25:35,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1867.59ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 84.8MB in the beginning and 128.6MB in the end (delta: -43.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.19ms. Allocated memory is still 184.5MB. Free memory was 128.6MB in the beginning and 125.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,877 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 124.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,877 INFO L158 Benchmark]: RCFGBuilder took 756.22ms. Allocated memory is still 184.5MB. Free memory was 124.4MB in the beginning and 103.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,877 INFO L158 Benchmark]: TraceAbstraction took 168882.01ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 103.5MB in the beginning and 331.8MB in the end (delta: -228.4MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,878 INFO L158 Benchmark]: Witness Printer took 60.11ms. Allocated memory is still 465.6MB. Free memory was 331.8MB in the beginning and 327.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:25:35,879 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.35ms. Allocated memory is still 107.0MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1867.59ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 84.8MB in the beginning and 128.6MB in the end (delta: -43.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.19ms. Allocated memory is still 184.5MB. Free memory was 128.6MB in the beginning and 125.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 124.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 756.22ms. Allocated memory is still 184.5MB. Free memory was 124.4MB in the beginning and 103.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 168882.01ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 103.5MB in the beginning and 331.8MB in the end (delta: -228.4MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. * Witness Printer took 60.11ms. Allocated memory is still 465.6MB. Free memory was 331.8MB in the beginning and 327.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: 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 5 procedures, 73 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 168.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 3385 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2394 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6250 IncrementalHoareTripleChecker+Invalid, 6504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 991 mSDtfsCounter, 6250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 757 SyntacticMatches, 29 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 86.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 130 PreInvPairs, 169 NumberOfFragments, 9716 HoareAnnotationTreeSize, 130 FomulaSimplifications, 808 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 25 FomulaSimplificationsInter, 23413 FormulaSimplificationTreeSizeReductionInter, 24.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1081 NumberOfCodeBlocks, 1081 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 1593 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1965 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 622/638 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: 32.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 236, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 156, TOOLS_POST_TIME: 12.8s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 10.5s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 5.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 396, TOOLS_QUANTIFIERELIM_TIME: 28.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 560, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 2.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 236, DOMAIN_ISBOTTOM_TIME: 0.7s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, 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: 7832, DAG_COMPRESSION_RETAINED_NODES: 572, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1666]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-22 01:25:35,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5eca2796-c621-40c5-8613-af294d71c2d0/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